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