Link distance and shortest path problems in the plane
| Autor: | Cook IV, A.F., Wenk, C., Goldberg, A.V., Zhou, Y. |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2009 |
| Předmět: |
Combinatorics
Widest path problem Euclidean shortest path TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Shortest path problem K shortest path routing Computer Science::Computational Geometry Voronoi diagram Yen's algorithm Weighted Voronoi diagram Distance Mathematics MathematicsofComputing_DISCRETEMATHEMATICS |
| Zdroj: | Algorithmic aspects in information and management : 5th international conference on algorithmic aspects in information and management (AAIM 2009), 15-17 June 2009 : proceedings, 141-151 STARTPAGE=141;ENDPAGE=151;TITLE=Algorithmic aspects in information and management : 5th international conference on algorithmic aspects in information and management (AAIM 2009), 15-17 June 2009 : proceedings Algorithmic Aspects in Information and Management ISBN: 9783642021572 AAIM |
| Popis: | We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Frechet distance in the plane with polygonal obstacles. Distances between points are measured either by link distance or by Euclidean shortest path distance. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|