Highly Influenced

@article{Aronov1988TheFG, title={The Furthest-Site Geodesic Voronoi Diagram}, author={Boris Aronov and Steven Fortune and Gordon T. Wilfong}, journal={Discrete & Computational Geometry}, year={1988}, volume={9}, pages={217-255} }

- Published 1988 in Discrete & Computational Geometry
DOI:10.1145/73393.73417

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

Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=73417.