Shortest Paths in Polygonal Domains with Polygon-Meet Constraints
نویسندگان
چکیده
In this paper, we study the problem of finding the shortest path in a polygonal domain in which the path should meet (touch or cross) a simple polygon in the domain. Our method uses the continuous Dijkstra paradigm and the idea of wavelet reflection and solves the problem in worst-case optimal time O(n log n).
منابع مشابه
Shortest Paths with Single-Point Visibility Constraints
This paper studies the problem of finding the shortest path between two points in presence of single-point visibility constraints. In this type of constraints, there should be at least one point on the output path from which a fixed viewpoint is visible. The problem is studied in various domains including simple polygons, polygonal domains, polyhedral surfaces. The method is based on partitioni...
متن کاملShortest Paths with Single-Point Visibility Constraint
This paper studies the problem of finding a shortest path between two points in presence of single-point visibility constraints. In this type of constraints, there should be at least one point on the output path from which a fixed viewpoint is visible. The problem is studied in various domains including simple polygons, polygonal domains, and polyhedral surfaces. The method is based on partitio...
متن کاملVisiting a Polygon on the Optimal Way to a Query Point
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 q...
متن کاملGeneralized Source Shortest Paths on Polyhedral Surfaces
We present an algorithm for computing shortest paths and distances from a single generalized source (point, segment, polygonal chain or polygon) to any query point on a possibly non-convex polyhedral surface. The algorithm also handles the case in which polygonal chain or polygon obstacles on the polyhedral surface are allowed. Moreover, it easily extends to the case of several generalized sour...
متن کاملShortest paths in simple polygons with polygon-meet constraints
We study a constrained version of the shortest path problem in simple polygons, in which the path must visit a given target polygon. We provide a worst-case optimal algorithm for this problem and also present a method to construct a subdivision of the simple polygon to efficiently answer queries to retrieve the shortest polygon-meeting paths from a single-source to the query point. The algorith...
متن کامل