Loading...

Query-point visibility constrained shortest paths in simple polygons

Khosravi, R ; Sharif University of Technology | 2007

173 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.tcs.2007.07.003
  3. Publisher: 2007
  4. Abstract:
  5. In this paper, we study the problem of finding the shortest path between two points inside a simple polygon such that there is at least one point on the path from which a query point is visible. We provide an algorithm which preprocesses the input in O (n2 + n K) time and space and provides logarithmic query time. The input polygon has n vertices and K is a parameter dependent on the input polygon which is O (n2) in the worst case but is much smaller for most polygons. The preprocessing algorithm sweeps an angular interval around every reflex vertex of the polygon to store the optimal contact points between the shortest paths and the windows separating the visibility polygons of the query points from the source and the destination. © 2007 Elsevier Ltd. All rights reserved
  6. Keywords:
  7. Algorithms ; Computational geometry ; Problem solving ; Query processing ; Visibility ; Logarithmic query time ; Polygons ; Preprocessing algorithms ; Shortest paths ; Constraint theory
  8. Source: Theoretical Computer Science ; Volume 389, Issue 1-2 , 2007 , Pages 1-11 ; 03043975 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/pii/S0304397507004963?via%3Dihub