AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
Discrete & Computational Geometry1987Vol. 2(4), pp. 365–393
Citations Over TimeTop 10% of 1987 papers
Related Papers
- → Farthest line segment Voronoi diagrams(2006)51 cited
- → On translating a set of line segments(1983)26 cited
- → Curved Voronoi Diagrams Consisting of Influence Areas with Differentiable Boundaries(2007)1 cited
- Using Voronoi Diagram to Solve Urban Greening Problem(2012)