On VR Spatial Query for Dual Entangled Worlds

摘要: With the rapid advent of Virtual Reality (VR) technology and virtual tour applications, there is a research need on spatial queries tailored for simultaneous movements in both physical worlds. Traditional queries, designed mainly one world, do not consider entangled dual worlds VR. In this paper, we first investigate fundamental shortest-path query VR as building block aiming to avoid hitting boundaries obstacles environment by leveraging Redirected Walking (RW) Computer Graphics. Specifically, formulate Dual-world Redirected-walking Obstacle-free Path (DROP) find minimum-distance path which constrained RW cost world ensure immersive experience We prove DROP NP-hard design fully polynomial-time approximation scheme, Dual Entangled World Navigation (DEWN), finding Minimum Immersion Loss Range (MIL Range). Afterward, show that existing algorithms index structures can leverage DEWN support kNN range Experimental results user study with implementation HTC VIVE manifest outperforms baselines smoother operations various scenarios.