Visiting a Polygon on the Optimal Way to a Query Point

Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm for this problem based on the wavefront propagation method and also present a method to construct a subdivision of the domain to efficiently answer queries to retrieve the constrained shortest paths from a single-source to the query point.

• Type: Conference
• Year: 2008
• Where: FAW
• Authors: Ramtin Khosravi, Mohammad Ghodsi
• Keywords: Algorithms, Constrained Shortest Paths, FAW 2008, Shortest Path Problem, Shortest Paths