Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
From MaRDI portal
Publication:5470949
DOI10.1137/040617364zbMath1115.65017OpenAlexW2065978712WikidataQ62111366 ScholiaQ62111366MaRDI QIDQ5470949
Maria Emelianenko, Lili Ju, Qiang Du
Publication date: 2 June 2006
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5cd92ec39eae98df3f77837650b14f4bba6f9fc4
\(k\)-meanslocal and global convergencecentroidal Voronoi tessellationsLloyd algorithmoptimal vector quantizer
Related Items
A method for generating moving, orthogonal, area preserving polygonal meshes ⋮ TCB-spline-based isogeometric analysis method with high-quality parameterizations ⋮ Centroidal Power Diagrams, Lloyd's Algorithm, and Applications to Optimal Location Problems ⋮ Construction of positive definite cubature formulae and approximation of functions via Voronoi tessellations ⋮ A geometric approach to non-parametric density estimation ⋮ The optimal centroidal Voronoi tessellations and the Gersho's conjecture in the three-dimensional space ⋮ Generalized edge-weighted centroidal Voronoi tessellations for geometry processing ⋮ Structure-sensitive superpixels via geodesic distance ⋮ A physics-motivated centroidal Voronoi particle domain decomposition method ⋮ A spatial regularization approach for vector quantization ⋮ An optimal particle setup method with centroidal Voronoi particle dynamics ⋮ Boundary feedback control of the Burgers equations by a reduced-order approach using centroidal Voronoi tessellations ⋮ The blockwise coordinate descent method for integer programs ⋮ A Lagrangian inertial centroidal Voronoi particle method for dynamic load balancing in particle-based simulations ⋮ Fast spherical centroidal Voronoi mesh generation: a Lloyd-preconditioned LBFGS method in parallel ⋮ Direct sampling on surfaces for high quality remeshing ⋮ Agglomeration of polygonal grids using graph neural networks with applications to multigrid solvers ⋮ Facility Location Problems: A Parameterized View ⋮ The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs ⋮ A velocity-based moving mesh virtual element method ⋮ Centroidal Voronoi tessellation in universal covering space of manifold surfaces ⋮ Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure ⋮ Mathematical Challenges in Measuring Variability Patterns for Precipitation Analysis ⋮ A versatile technique for the optimal approximation of random processes by functional quantization ⋮ Fast centroidal Voronoi Delaunay triangulation for unstructured mesh generation ⋮ Numerical methods for low‐order modeling of fluid flows based on POD ⋮ Fast methods for computing centroidal Laguerre tessellations for prescribed volume fractions with applications to microstructure generation of polycrystalline materials ⋮ A new multi-resolution parallel framework for SPH ⋮ Constrained CVT meshes and a comparison of triangular mesh generators ⋮ Polygonal finite elements for topology optimization: A unifying paradigm ⋮ ReALE: a Reconnection Arbitrary-Lagrangian-Eulerian method in cylindrical geometry ⋮ Introduction to vector quantization and its applications for numerics ⋮ Reale: a Reconnection-based Arbitrary-Lagrangian-Eulerian method ⋮ Recent progress in robust and quality Delaunay mesh generation ⋮ Facility location problems: a parameterized view ⋮ Geometric Self-Assembly of Rigid Shapes: A Simple Voronoi Approach ⋮ Pointwise Convergence of the Lloyd I Algorithm in Higher Dimension ⋮ Human–Swarm Interactions via Coverage of Time-Varying Densities ⋮ A Simple Geometric Method for Navigating the Energy Landscape of Centroidal Voronoi Tessellations ⋮ Fast methods for computing centroidal Voronoi tessellations ⋮ On The Characterization and Uniqueness of Centroidal Voronoi Tessellations
Uses Software
