Shortest paths in simple polygons with polygon-meet constraints

Khosravi, R ; Sharif University of Technology | 2004

35 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.ipl.2004.04.010
  3. Publisher: 2004
  4. Abstract:
  5. 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 algorithms are linear, both in time and space, in terms of the complexity of the two polygons. © 2004 Elsevier B.V. All rights reserved
  6. Keywords:
  7. Computational geometry ; Polygon-meet ; Shortest path ; Shortest path map
  8. Source: Information Processing Letters ; Volume 91, Issue 4 , 2004 , Pages 171-176 ; 00200190 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S002001900400136X