Jump flooding algorithm
The jump flooding algorithm (JFA) is a flooding algorithm used in the construction of Voronoi diagrams and distance transforms.
≈ 1 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.
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. The JFA has desirable attributes in GPU computation, notably for its efficient performance.
However, it is only an approximate algorithm and does not always compute the correct result for every pixel, although in practice errors are few and the magnitude of errors is generally small. of a 200×200 grid with nine seed pixels. The algorithm converges in three iterations: k = 100, k = 50, k = 25 The jump flooding algorithm and its variants may be used for calculating Voronoi maps and centroidal Voronoi tessellations (CVT), generating distance fields, point-cloud rendering, feature matching, the computation of power diagrams, and soft shadow rendering.
The grand strategy game developer Paradox Interactive uses the JFA to render borders between countries and provinces.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1373343966 under CC BY-SA 4.0; modifications have been made.