Fortune's algorithm

Fortune's algorithm is a sweep line algorithm for generating a Voronoi diagram from a set of points in a plane using O(n log n) time and O(n) space.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 7 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Fortune's algorithm is a sweep line algorithm for generating a Voronoi diagram from a set of points in a plane using O(n log n) time and O(n) space.[1][2] It was originally published by Steven Fortune in 1986 in his paper "A sweepline algorithm for Voronoi diagrams."[3]

Contents

Algorithm description

edit edit source

The algorithm maintains both a sweep line and a beach line, which both move through the plane as the algorithm progresses. The sweep line is a straight line, which we may by convention assume to be vertical and moving left to right across the plane. At any time during the algorithm, the input points left of the sweep line will have been incorporated into the Voronoi diagram, while the points right of the sweep line will not have been considered yet. The beach line is not a straight line, but a complicated, piecewise curve to the left of the sweep line, composed of pieces of parabolas; it divides the portion of the plane within which the Voronoi diagram can be known, regardless of what other points might be right of the sweep line, from the rest of the plane. For each point left of the sweep line, one can define a parabola of points equidistant from that point and from the sweep line; the beach line is the boundary of the union of these parabolas. As the sweep line progresses, the vertices of the beach line, at which two parabolas cross, trace out the edges of the Voronoi diagram. The beach line progresses by keeping each parabola base exactly halfway between the points initially swept over with the sweep line, and the new position of the sweep line. Mathematically, this means each parabola is formed by using the sweep line as the directrix and the input point as the focus.

The algorithm maintains as data structures a binary search tree describing the combinatorial structure of the beach line, and a priority queue listing potential future events that could change the beach line structure. These events include the addition of another parabola to the beach line (when the sweep line crosses another input point) and the removal of a curve from the beach line (when the sweep line becomes tangent to a circle through some three input points whose parabolas form consecutive segments of the beach line). Each such event may be prioritized by the x-coordinate of the sweep line at the point the event occurs. The algorithm itself then consists of repeatedly removing the next event from the priority queue, finding the changes the event causes in the beach line, and updating the data structures.

As there are O(n) events to process (each being associated with some feature of the Voronoi diagram) and O(log n) time to process an event (each consisting of a constant number of binary search tree and priority queue operations) the total time is O(n log n).

Pseudocode

edit edit source

Pseudocode description of the algorithm.[4]

let ∗(z) be the transformation ∗(z)=(zx,zy+d(z)), where d(z) is the Euclidean distance between z and the nearest site let T be the "beach line" let Rp be the region covered by site p. let Cpq be the boundary ray between sites p and q. let S be a set of sites on which this algorithm is to be applied. let p1,p2,...,pm be the sites extracted from S with minimal y-coordinate, ordered by x-coordinate let DeleteMin( X) be the act of removing the lowest and leftmost site of X (sort by y unless they're identical, in which case sort by x) let V be the Voronoi map of S which is to be constructed by this algorithm Q←p1,p2,…,pm,S create initial vertical boundary rays Cp1,p20,Cp2,p30,…,Cpm−1,pm0 T←∗(Rp1),Cp1,p20,∗(Rp2),Cp2,p30,…,∗(Rpm−1),Cpm−1,pm0,∗(Rpm) while not IsEmpty( Q) do p ← DeleteMin( Q) case p of p is a site in ∗(V): find the occurrence of a region ∗(Rq) in T containing p, bracketed by Crq on the left and Cqs on the right create new boundary rays Cpq− and Cpq+ with bases p replace ∗(Rq) with ∗(Rq),Cpq−,∗(Rp),Cpq+,∗(Rq) in T delete from Q any intersection between Crq and Cqs insert into Q any intersection between Crq and Cpq− insert into Q any intersection between Cpq+ and Cqs p is a Voronoi vertex in ∗(V): let p be the intersection of Cqr on the left and Crs on the right let Cuq be the left neighbor of Cqr and let Csv be the right neighbor of Crs in T if qy=sy, create a new boundary ray Cqs0 else if p is right of the higher of q and s, create Cqs+ else create Cqs− endif replace Cqr,∗(Rr),Crs with newly created Cqs in T delete from Q any intersection between Cuq and Cqr delete from Q any intersection between Crs and Csv insert into Q any intersection between Cuq and Cqs insert into Q any intersection between Cqs and Csv record p as the summit of Cqr and Crs and the base of Cqs output the boundary segments Cqr and Crs endcase endwhile output the remaining boundary rays in T

Weighted sites and disks

edit edit source

Additively weighted sites

edit edit source

As Fortune describes in ref.,[1] a modified version of the sweep line algorithm can be used to construct an additively weighted Voronoi diagram, in which the distance to each site is offset by the weight of the site; this may equivalently be viewed as a Voronoi diagram of a set of disks, centered at the sites with radius equal to the weight of the site. the algorithm is found to have O(nlog⁡(n)) time complexity with n being the number of sites according to ref.[1]

Weighted sites may be used to control the areas of the Voronoi cells when using Voronoi diagrams to construct treemaps. In an additively weighted Voronoi diagram, the bisector between sites is in general a hyperbola, in contrast to unweighted Voronoi diagrams and power diagrams of disks for which it is a straight line.

References

edit edit source
  1. ^ a b c de Berg, Mark; van Kreveld, Marc; Overmars, Mark; Schwarzkopf, Otfried (2000), Computational Geometry (2nd revised ed.), Springer-Verlag, ISBN 3-540-65620-0 Section 7.2: Computing the Voronoi Diagram: pp.151–160. Wikipedia revision 1320640602, retrieved 2026-11-20
  2. ^ Austin, David, Voronoi Diagrams and a Day at the Beach, Feature Column, American Mathematical Society. Wikipedia revision 1320640602, retrieved 2026-11-20
  3. ^ Steven Fortune. A sweepline algorithm for Voronoi diagrams. Proceedings of the second annual symposium on Computational geometry. Yorktown Heights, New York, United States, pp.313–322. 1986. ISBN 0-89791-194-6. ACM Digital LibrarySpringerLink Wikipedia revision 1320640602, retrieved 2026-11-20
  4. ^ Kenny Wong, Hausi A. Müller, An Efficient Implementation of Fortune's Plane-Sweep Algorithm for Voronoi Diagrams, CiteSeerX 10.1.1.83.5571 {{citation}}: Cite uses deprecated parameter |citeseerx= (help). Wikipedia revision 1320640602, retrieved 2026-11-20
edit edit source

Text derived from https://en.wikipedia.org/w/index.php?oldid=1320640602 under CC BY-SA 4.0; modifications have been made.

References

  1. ↩Wikipedia “Fortune's algorithm” revision 1320640602 · retrieved 2026-10-20 publication date (×1) · confidence 0.95 revision URL