Live briefing
Everything about Jump flooding algorithm
Class of algorithms used for computing distance-related functions
The jump flooding algorithm (JFA) is a flooding algorithm used in the construction of Voronoi diagrams and distance transforms. The JFA was introduced by Rong Guodong at an ACM symposium in 2006. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Jump flooding algorithmA 5-minute orientation
- Pick up a classic book: Introduction to making very big booksThe most-reprinted book on the subject
- Go sideways: Voronoi diagramA closely related topic
- Go sideways: Lloyd's 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
Introduction to making very big booksUnited States. Congress. Senate. Committee on Pensions · 2011
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…
- Lloyd's algorithm In electrical engineering and computer science, Lloyd's algorithm, also known as Voronoi iteration or relaxation, is an algorithm named after Stuart P…
- Power diagram In computational geometry, a power diagram, also called a Laguerre–Voronoi diagram, Dirichlet cell complex, radical Voronoi tesselation or a sectional…
- Closest pair of points problem The closest pair of points problem or closest pair problem is a problem of computational geometry: given n {\displaystyle n} points in metric space, find…
- Largest empty rectangle In computational geometry, the largest empty rectangle problem, maximal empty rectangle problem or maximum empty rectangle problem, is the problem of finding…
- Cook–Levin theorem In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete…
- Bowyer–Watson algorithm In computational geometry, the Bowyer–Watson algorithm is a method for computing the Delaunay triangulation of a finite set of points in any number of…
- 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. It…