Loading...

Visiting a polygon on the optimal way to a query point

Khosravi, R ; Sharif University of Technology | 2008

404 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-540-69311-6_26
  3. Publisher: 2008
  4. Abstract:
  5. 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. © 2008 Springer-Verlag Berlin Heidelberg
  6. Keywords:
  7. Neodymium ; Telecommunication networks ; Wavefronts ; Algorithmics ; Efficient algorithms ; Heidelberg (CO) ; International (CO) ; Polygonal domains ; Problem based ; Shortest Path (SP) ; Shortest path problem (SPP) ; Springer (CO) ; Wavefront propagation (WFP) ; Wireless sensor networks
  8. Source: 2nd International Frontiers in Algorithmics Workshop, FAW 2008, Changsha, 19 June 2008 through 21 June 2008 ; Volume 5059 LNCS , 2008 , Pages 245-251 ; 03029743 (ISSN); 3540693106 (ISBN); 9783540693109 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007%2F978-3-540-69311-6_26