A sweepline algorithm for Voronoi diagrams

  • Authors:
  • S Fortune

  • Affiliations:
  • AT&T Bell Laboratories, Murray Hill, New Jersey

  • Venue:
  • SCG '86 Proceedings of the second annual symposium on Computational geometry
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a transformation that can be used to compute Voronoi diagrams with 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 have &Ogr;(n log n) worst case running time and use &Ogr;(n) space.