Abstract
This paper proposes a new algorithm for querying the shortest path between two points s and t in a simple polygon P based on Voronoi diagram(VD). Based on the polygon’s VD, we first find the Voronoi skeleton path S(s,t) from points to t, and then along which we compute the shortest path SP(s,t) by visibility computing simultaneously. SP(s,t) can be reported in time O(n). It can be used in our 3D virtual museum system, in which the polygon’s VD is used as a data structure for path planning, visibility computing, collision detection, and so on.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
de Berg, M., van Kreveld, M., Overrmars, M., chwarzkopf, O.: Computational geometry: algorithms and applications, 2nd edn. Springer, New York (2000)
Deok-Soo, K., Yu, K., Cho, Y., Kim, D., Yap, C.: Shortest Paths for Disc Obstacles. In: Laganà, A., Gavrilova, M., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3043, pp. 62–70. Springer, Heidelberg (2004)
Wein, R., van den Berg, J.P., Halperin, D.: The Visibility–Voronoi Complex and Its Applications. Computational Geometry 36(1), 66–87 (2007)
Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. In: Proc. Third Annual Symposium on Computational Geometry, pp. 50–63 (2005)
Goodman, J.E., O’Rourke, J.: Handbook of discrete and Computational Geometry, 2nd edn. CRC Press, Boca Raton, USA (2004)
Wang, L., Yang, C., Qi, M., Meng, X., Wang, X.: Design of a Walkthrough System for Virtual Museum Based on Voronoi Diagram. In: ISVD 2006. Proc. 3rd International Symposium on Voronoi Diagrams in Science and Engineering, pp. 258–263 (2006)
Meng, X., Qi, M., Yang, C., Wang, L.: Path Planning in Virtual Museum Based on Polygon’s Voronoi Diagram. Journal of Computational Information Systems 2(1), 89–97 (2006)
Takahashi, O., Schilling, R.J.: Motion planning in a plane using generalized Voronoi diagrams. IEEE Transactions on Robotics and Automation 5(2), 143–150 (1989)
Blaer, P.S.: Robot Path Planning Using Generalized Voronoi Diagrams, http://www.cs.columbia.edu/~pblaer/projects/path_planner/
Hoff, K., Culver, T., Keyser, J., Lin, M., Manocha, D.: Interactive motion planning using hardware accelerated computation of generalized Voronoi diagrams. In: Proc. IEEE Conference on Robotics and Automation, pp. 2931–2937. IEEE Computer Society Press, Los Alamitos (2000)
Bhattacharya, P., Gavrilova, M.L.: Voronoi Diagram in Optimal Path Planning. In: The 4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD, IEEE-CS Press, Cardiff, UK, July,2007 (2007) (accepted to)
Cheng-Lei, Y., Jia-Ye, W., Xiang-Xu, M.: Upper Bounds on the Size of Inner Voronoi Diagrams of Multiply Connected Polygons. Journal of Software 17(7), 1527–1534 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, C., Qi, M., Wang, J., Wang, X., Meng, X. (2007). Shortest Path Queries in a Simple Polygon for 3D Virtual Museum. In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74472-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-74472-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74468-9
Online ISBN: 978-3-540-74472-6
eBook Packages: Computer ScienceComputer Science (R0)