Construction of Voronoi diagrams in the plane by using maps

Citations of this article
Mendeley users who have this article in their library.


An algorithm by Guibas and Stolfi (1985) constructs, for a finite set S of n sites in the plane, a triangulation T(S) of S that strictly refines the Delaunay diagram Del(S) when there exists a circle passing through at least four points of S and none of the sites is contained in its interior. For this triangulation T(S) there exist isometries T such that T(T(S))≠T(T(S)). The Voronoi diagram Vor(S) is the straight-line dual of Del(S) and the substitution of T(S) into Del(S) leads to needless calculus, indeed to the creation of imaginary vertices for Vor(S). We present here a variant of the Guibas and Stolfi algorithm that determines, with the same complexity, Del(S) and not a triangulation, and uses a simpler data structure. We also give approximation tests of collinearity and cocircularity so that for any similitude T of the plane, Del(T(S))= T(Del(S)). © 1990.




Elbaz, M., & Spehner, J. C. (1990). Construction of Voronoi diagrams in the plane by using maps. Theoretical Computer Science, 77(3), 331–343.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free