Jump to content

Fortune's algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ino5hiro (talk | contribs) at 05:45, 8 February 2007 (Initial page creation.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Fortune's algorithm is an O(n log n) plane sweep algorithm for generating a Voronoi diagram from a set of points in a plane.

The key point of the algorithm is that, as you sweep across the plane, you are locking in known points and setting possible points via a beach line. Whether is it a certain (locked) vertex or a possible vertex is determined by the circle and point events that occur as you sweep.

Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Fortune%27s_algorithm&oldid=106508573"