A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A linear-time algorithm for computing the voronoi diagram of a convex polygon

1989
*
Discrete & Computational Geometry
*

We present an algorithm for computing certain kinds of threedimensional convex hulls in linear time. Using this algorithm, we show that the Voronoi diagram of n sites in the plane can be computed in O(n) time when these sites form the vertices of a convex polygon in, say, counterclockwise order. This settles an open problem in computational geometry. Our techniques can also be used to obtain linear-time algorithms for computing the furthest-site Voronoi diagram and the medial axis of a convex

doi:10.1007/bf02187749
fatcat:imdybpi2lfh65izvvqu5woeneu