Click canvas to add seeds | Energy: —
Voronoi tessellation: given N seed points, partition the plane so each region contains all points closer to its seed than to any other.
The Delaunay triangulation is the dual graph — connecting seeds whose regions share an edge — and it maximizes the minimum angle.
Lloyd's algorithm: repeatedly replace each seed with the centroid of its Voronoi region. This minimizes the quantization energy E = Σ∫Vᵢ|x − sᵢ|² dx, converging to a centroidal Voronoi diagram — optimally uniform tiling used in mesh generation, stippling, and k-means clustering.
Lloyd's algorithm: repeatedly replace each seed with the centroid of its Voronoi region. This minimizes the quantization energy E = Σ∫Vᵢ|x − sᵢ|² dx, converging to a centroidal Voronoi diagram — optimally uniform tiling used in mesh generation, stippling, and k-means clustering.