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

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. © Springer-Verlag Berlin Heidelberg 2007.