Construction of Voronoi diagrams in the plane by using maps

  • Elbaz M
  • Spehner J
  • 5

    Readers

    Mendeley users who have this article in their library.
  • 1

    Citations

    Citations of this article.

Abstract

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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Mounir Elbaz

  • Jean Claude Spehner

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free