Sciweavers

Share
FAW
2008
Springer

Visiting a Polygon on the Optimal Way to a Query Point

8 years 4 months ago
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.
Ramtin Khosravi, Mohammad Ghodsi
Added 19 Oct 2010
Updated 19 Oct 2010
Type Conference
Year 2008
Where FAW
Authors Ramtin Khosravi, Mohammad Ghodsi
Comments (0)
books