The Furthest-Site Geodesic Voronoi Diagram

  title={The Furthest-Site Geodesic Voronoi Diagram},
  author={Boris Aronov and Steven Fortune and Gordon T. Wilfong},
  journal={Discrete & Computational Geometry},
A common goal of much recent research in computational geometaT has been to extend algorithms that have been developed for the Euclidean metric to the more complicated geodesic metric inside a simple polygon. The geodesic distance between two points in a simple polygon is the length of the shortest path connecting the points that remains inside the polygon. For example, Toussaint [T86] gives an algorithm for the "relative convex hull" of a set of points inside a simple polygon; Aronov [A87… CONTINUE READING