Work

Shortest Paths With Single-point Visibility Constraint

Year: 2006
Type: article
Abstract: 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 partitioning the boundary of the visibility region of the viewpoint into a number of intervals. This is done from the combinatorial structure of shortest paths from source and destination to the points on the boundary. Our result for the case of simple polygons is optimal with O(n) time bound. The running time for the cases of polygonal domains, convex and non-convex polyhedral surfaces are O(n 2), O(n 2), and O(n 3) respectively.
Language: English
Open Access status: diamond
OpenAlex ID: W2298605023
FWCI: 0.374
Cites: 23
Cited by: 2
Related to: 7