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.

• Type: Conference
• Year: 2009
• Where: AAIM
• Authors: Atlas F. Cook, Carola Wenk
• Keywords: AAIM 2009, Algorithms, Fr´echet Distance, Shortest Path, Shortest Path Distance