Loading...
  1. Simple search
  2. Search result
Search for: shortest-path--sp
0.005 seconds
Total 1 records

      Visiting a polygon on the optimal way to a query point

      , Article 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) Khosravi, R ; Ghodsi, M ; Sharif University of Technology
      2008
      Abstract
      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  
    Total 1 records