Live briefing
Everything about Fortune's algorithm
Voronoi diagram generation 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. It was originally published by Steven Fortune in 1986 in his paper "A sweepline algorithm for Voronoi diagrams." Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Fortune's algorithmA 5-minute orientation
- Pick up a classic book: Out of controlThe most-reprinted book on the subject
- Go sideways: Voronoi diagramA closely related topic
- Go sideways: Sweep line algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
📚 Books worth reading
Out of controlKevin Kelly · 1994- 📕Amazon FBA AlgorithmsMarketing Legacy, Kevin Davon · 2020
Sensitivity AnalysisAndrea Saltelli, K. Chan · 2000
Java Methods A&AB, AP EditionGary Litvin, Maria Litvin · 2006
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Voronoi diagram In mathematics, a Voronoi diagram is a partition of a plane into regions close to each of a given set of objects. It can be classified also as a tessellation…
- Sweep line algorithm In computational geometry, a sweep line algorithm or plane sweep algorithm is an algorithmic paradigm that uses a conceptual sweep line or sweep surface…
- Power diagram In computational geometry, a power diagram, also called a Laguerre–Voronoi diagram, Dirichlet cell complex, radical Voronoi tesselation or a sectional…
- Parabola In mathematics, a parabola (/pəˈræbələ/ pə-RA-bə-lə) is a plane curve which is mirror-symmetrical and is approximately U-shaped. It fits several superficially…
- Delaunay triangulation In computational geometry, a Delaunay triangulation or Delone triangulation of a set of points in the plane subdivides their convex hull into triangles…
- Computational geometry Computational geometry is a branch of computer science devoted to the study of algorithms that can be stated in terms of geometry. Some purely geometrical…
- Smallest-circle problem The smallest-circle problem (also known as minimum covering circle problem, bounding circle problem, least bounding circle problem, smallest enclosing…
- Perpendicular In geometry, two geometric objects are perpendicular if they intersect at right angles, i.e. at an angle of 90 degrees or π/2 radians. The condition of…