# Fortune's Algorithm for Voronoi Diagrams

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

Given a finite set of points (called sites) in a plane, a Voronoi diagram divides the plane into regions around each site that are closer to that site than to any of the others. This Demonstration shows Fortune's algorithm for drawing Voronoi diagrams [1].

[more]
Contributed by: Erik Mahieu (July 2016)

Open content licensed under CC BY-NC-SA

## Snapshots

## Details

Reference

[1] S. Fortune, "A Sweepline Algorithm for Voronoi Diagrams," *Algorithmica*, 2, 1987 pp. 153–174. www.wias-berlin.de/people/si/course/files/Fortune87-SweepLine-Voronoi.pdf.

## Permanent Citation

"Fortune's Algorithm for Voronoi Diagrams"

http://demonstrations.wolfram.com/FortunesAlgorithmForVoronoiDiagrams/

Wolfram Demonstrations Project

Published: July 19 2016