Shortest path queries in a simple polygon for 3D virtual museum

Authors:
Chenglei Yang;Meng Qi;Jiaye Wang;Xiaoting Wang;Xiangxu Meng
Affiliations:
School of Computer Science and Technology, Shandong University, Jinan, China;School of Computer Science and Technology, Shandong University, Jinan, China;School of Computer Science and Technology, Shandong University, Jinan, China;School of Computer Science and Technology, Shandong University, Jinan, China;School of Computer Science and Technology, Shandong University, Jinan, China
Venue:
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Year:
2007

Citing 4
Cited 0

Optimal shortest path queries in a simple polygon

SCG '87 Proceedings of the third annual symposium on Computational geometry
Design of a Walkthrough System for Virtual Museum Based on Voronoi Diagram

ISVD '06 Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering
The visibility-Voronoi complex and its applications

Computational Geometry: Theory and Applications - Special issue on the 21st European workshop on computational geometry (EWCG 2005)
Voronoi diagram in optimal path planning

ISVD '07 Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering

Quantified Score

Hi-index	0.00

Visualization

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 point s 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.