[1] Takuya Akiba, Takanori Hayashi, Nozomi Nori, Yoichi Iwata, and Yuichi Yoshida. Efficient top-k shortest-path distance queries on large networks by pruned landmark labeling. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 29, 2015.
[2] Anika Anwar and Tanzima Hashem. Optimal obstructed sequenced route queries in spatial databases. In EDBT, pages 522–525, 2017.
[3] Evren Bozgeyikli, Andrew Raij, Srinivas Katkoori, and Rajiv Dubey. Point & teleport locomotion technique for virtual reality. In Proceedings of the 2016 annual symposium on computer-human interaction in play, pages 205–216, 2016.
[4] Shao-Heng Ko, Ying-Chun Lin, Hsu-Chao Lai, Wang-Chien Lee, and De-Nian Yang. On vr spatial query for dual entangled worlds. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management, pages 9–18, 2019.
[5] Andreas Kunz, Markus Zank, Morten Fjeld, and Thomas Nescher. Real walking in virtual environments for factory planning and evaluation. Procedia Cirp, 44:257–262, 2016.
[6] Eike Langbehn, Paul Lubos, and Frank Steinicke. Evaluation of locomotion techniques for room-scale vr: Joystick, teleportation, and redirected walking. In Proceedings of the Virtual Reality International Conference-Laval Virtual, pages 1–9, 2018.
[7] Ying Lu, Jiaheng Lu, Gao Cong, Wei Wu, and Cyrus Shahabi. Efficient algorithms and cost models for reverse spatial-keyword k-nearest neighbor search. ACM Transactions on Database Systems (TODS), 39(2):1–46, 2014.
[8] Silvano Martello and Paolo Toth. Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Inc., 1990.
[9] Sebastian Marwecki, Maximilian Brehm, Lukas Wagner, Lung-Pan Cheng, Florian’Floyd’ Mueller, and Patrick Baudisch. Virtualspace-overloading physical space with multiple virtual reality users. In Proceedings of the 2018 CHI Conference on Human Factors in Computing Systems, pages 1–10, 2018.
[10] Ellips Masehian and MR Amin-Naseri. A voronoi diagram-visibility graph-potential field compound algorithm for robot path planning. Journal of Robotic Systems, 21(6):275–300, 2004.
[11] Marcell Missura, Daniel D Lee, and Maren Bennewitz. Minimal construct: Efficient shortest path finding for mobile robots in polygonal maps. In 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages 7918–7923. IEEE, 2018.
[12] Niels Christian Nilsson, Evan Suma, Rolf Nordahl, Mark Bolas, and Stefania Serafin. Estimation of detection thresholds for audiovisual rotation gains. In 2016 IEEE Virtual Reality (VR), pages 241–242. IEEE, 2016.
[13] Niels Christian Nilsson, Tabitha Peck, Gerd Bruder, Eri Hodgson, Stefania Serafin, Mary Whitton, Frank Steinicke, and Evan Suma Rosenberg. 15 years of research on redirected walking in immersive virtual environments. IEEE computer graphics and applications, 38(2):44–56, 2018.
[14] Roy A Ruddle, Ekaterina Volkova, and Heinrich H Bülthoff. Walking improves your cognitive map in environments that are large-scale and large in extent. ACM Transactions on Computer-Human Interaction (TOCHI), 18(2):1–20, 2011.
[15] Stefania Serafin, Niels C Nilsson, Erik Sikstrom, Amalia De Goetzen, and Rolf Nordahl. Estimation of detection thresholds for acoustic based redirected walking techniques. in 2013 ieee virtual reality (vr). IEEE. http://dx. doi. org/10.1109/vr, 2013.
[16] Nusrat Sultana, Tanzima Hashem, and Lars Kulik. Group nearest neighbor queries in the presence of obstacles. In Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 481–484, 2014.
[17] Qi Sun, Anjul Patney, Li-Yi Wei, Omer Shapira, Jingwan Lu, Paul Asente, Suwen Zhu, Morgan McGuire, David Luebke, and Arie Kaufman. Towards virtual reality infinite walking: dynamic saccadic redirection. ACM Transactions on Graphics (TOG), 37(4):1–13, 2018.
[18] Yaping Sun, Zhiyong Chen, Meixia Tao, and Hui Liu. Communication, computing and caching for mobile vr delivery: Modeling and trade-off. In 2018 IEEE International Conference on Communications (ICC), pages 1–6. IEEE, 2018.
[19] Sibo Wang, Xiaokui Xiao, Yin Yang, and Wenqing Lin. Effective indexing for approximate constrained shortest path queries on large road networks. Proceedings of the VLDB Endowment, 10(2):61–72, 2016.
[20] Huaijie Zhu, Xiaochun Yang, Bin Wang, and Wang-Chien Lee. Range-based obstructed nearest neighbor queries. In Proceedings of the 2016 International Conference on Management of Data, pages 2053–2068, 2016