Sciweavers

AAIM
2009
Springer

Link Distance and Shortest Path Problems in the Plane

14 years 5 months ago
Link Distance and Shortest Path Problems in the Plane
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured either by link distance or by Euclidean shortest path distance.
Atlas F. Cook, Carola Wenk
Added 25 May 2010
Updated 25 May 2010
Type Conference
Year 2009
Where AAIM
Authors Atlas F. Cook, Carola Wenk
Comments (0)