Algorithmica

, 2:153

A sweepline algorithm for Voronoi diagrams

  • Steven Fortune
Article

DOI: 10.1007/BF01840357

Cite this article as:
Fortune, S. Algorithmica (1987) 2: 153. doi:10.1007/BF01840357

Abstract

We introduce a geometric transformation that allows Voronoi diagrams to be computed using a sweepline technique. The transformation is used to obtain simple algorithms for computing the Voronoi diagram of point sites, of line segment sites, and of weighted point sites. All algorithms haveO(n logn) worst-case running time and useO(n) space.

Key words

Voroni diagramDelaunay triangulationSweepline algorithm

Copyright information

© Springer-Verlag New York Inc. 1987

Authors and Affiliations

  • Steven Fortune
    • 1
  1. 1.AT&T Bell LaboratoriesMurray HillUSA