DELAUNAY // VORONOI MESH
Empty circumcircle criterion computing Bowyer-Watson Delaunay triangulation and dual Voronoi cells.
π
ACADEMIC & ALGORITHMIC REFERENCERESEARCH & LEARNING VAULT // Delaunay Triangulation & Voronoi Duals
Computational geometry, Bowyer-Watson empty circumcircles, and Dirichlet partitions.
// HISTORICAL ORIGINS
Boris Delaunay defined the triangulation in 1934 (maximizing minimum angles), while Georgy Voronoy formalized the dual nearest-neighbor spatial tessellation in 1908.
// GOVERNING EQUATIONS
// BROWSER IMPLEMENTATION
Implements the Bowyer-Watson incremental insertion algorithm with circumcircle tests, computing dual Voronoi edges by connecting triangle circumcenters.
// GUIDED EXPERIMENTS TO TRY IN THIS SANDBOXNORMAL
1Lloyd Centroid Relaxation
π― Action:Add 20 sites and repeatedly click 'Lloyd Step'.
β¨ Observe:Watch irregularly shaped polygons smooth out into an optimal hexagonal honeycomb lattice.