Geometric k shortest paths

S. Eriksson-Bique, J. Hershberger, V. Polishchuk, B. Speckmann, S. Suri, T. Talvitie, K.A.B. Verbeek, H. Yildiz

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

7 Citaten (Scopus)
112 Downloads (Pure)

Samenvatting

We consider the problem of computing k shortest paths in a two-dimensional environment with polygonal obstacles, where the jth path, for 1 = j = k, is the shortest path in the free space that is also homotopically distinct from each of the first j – 1 paths. In fact, we consider a more general problem: given a source point s, construct a partition of the free space, called the kth shortest path map (k-SPM), in which the homotopy of the kth shortest path in a region has the same structure. Our main combinatorial result establishes a tight bound of T(k2h + kn) on the worst-case complexity of this map. We also describe an O((k3h + k2n) log (kn)) time algorithm for constructing the map. In fact, the algorithm constructs the jth map for every j = k. Finally, we present a simple visibility-based algorithm for computing the k shortest paths between two fixed points. This algorithm runs in O(m log n + k) time and uses O(m + k) space, where m is the size of the visibility graph. This latter algorithm can be extended to compute k shortest simple (non-self-intersecting) paths, taking O(k2 m(m + kn) log (kn)) time. We invite the reader to play with our applet demonstrating k-SPMs [10].
Originele taal-2Engels
TitelTwenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'15, San Diego CA, USA, January 4-6, 2015)
Plaats van productiePhiladelpia
UitgeverijSociety for Industrial and Applied Mathematics (SIAM)
Pagina's1616-1625
ISBN van geprinte versie978-1-61197-374-7
DOI's
StatusGepubliceerd - 2015
Evenement26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015) - Westin San Diego Gaslamp Quarter, San Diego, Verenigde Staten van Amerika
Duur: 4 jan 20156 jan 2015
Congresnummer: 26
http://www.siam.org/meetings/da15/

Congres

Congres26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)
Verkorte titelSODA '15
LandVerenigde Staten van Amerika
StadSan Diego
Periode4/01/156/01/15
AnderTwenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
Internet adres

Vingerafdruk Duik in de onderzoeksthema's van 'Geometric k shortest paths'. Samen vormen ze een unieke vingerafdruk.

Citeer dit