Event-Centered Maze Generation Method for Mobile Virtual Reality Applications
Open Access
Abstract
This study proposes a method of effectively creating mobile virtual reality scenes centered at events for the purpose of providing new experiences in virtual reality environment to users. For this purpose, this paper uses Prim’s maze generation algorithm to automatically create maze environments that have different patterns every time and to compute mazes with finite paths. This paper designs a scheme of creating virtual reality scenes based on event-centered mazes to maximize users’ tension and immersion. Here, event components that are appropriate for the maze environment are defined and maze patterns are created centered at the event point where events that are appropriate for the maze pattern are automatically created. Finally, the paper analyzes whether the proposed virtual reality scene based on event-centered mazes is helpful in enhancing users’ immersion and arousing their interest through diverse experiments.Keywords
Funding Information
- National Research Foundation of Korea (NRF-2014R1A1A2055834)
- Korea Foundation for the Advancement of Science & Creativity
This publication has 12 references indexed in Scilit:
- Visual semantic approach for virtual scene generation2011
- Modeling the effects of delayed haptic and visual feedback in a collaborative virtual environmentACM Transactions on Computer-Human Interaction, 2007
- Recent Developments and Applications of Haptic DevicesComputer Graphics Forum, 2003
- Put: language-based interactive manipulation of objectsIEEE Computer Graphics and Applications, 1996
- Surround-screen projection-based virtual reality1993
- The CAVE: audio visual experience automatic virtual environmentCommunications of the ACM, 1992
- A head-mounted three dimensional display1968
- A Platform with Six Degrees of FreedomProceedings of the Institution of Mechanical Engineers, 1965
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956