We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in the plane with polygonal obstacles. Distances between points are measured either by link distance or by Euclidean shortest path distance.
|Title of host publication||Algorithmic aspects in information and management : 5th international conference on algorithmic aspects in information and management (AAIM 2009), 15-17 June 2009 : proceedings|
|Editors||A.V. Goldberg, Y. Zhou|
|Place of Publication||Berlin|
|Publication status||Published - 2009|
|Name||Lecture Notes in Computer Science|