Fast methods for computing centroidal Voronoi tessellations

DOI10.1007/s10915-014-9894-1zbMath1328.62386OpenAlexW2028278786MaRDI QIDQ2355581

Long Chen, James C. Hateley, Huayi Wei

Publication date: 24 July 2015

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-014-9894-1

zbMATH Keywords

quasi-Newton methodsnumerical optimizationcentroidal Voronoi tessellationLloyd's method

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Numerical computation of solutions to systems of equations (65H10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

Stable honeycomb structures and temperature based trajectory optimization for wire-arc additive manufacturing ⋮ Centroidal Power Diagrams, Lloyd's Algorithm, and Applications to Optimal Location Problems ⋮ The finite cell method for polygonal meshes: poly-FCM ⋮ Fast spherical centroidal Voronoi mesh generation: a Lloyd-preconditioned LBFGS method in parallel ⋮ Mathematical Challenges in Measuring Variability Patterns for Precipitation Analysis ⋮ Fast methods for computing centroidal Laguerre tessellations for prescribed volume fractions with applications to microstructure generation of polycrystalline materials ⋮ A Simple Geometric Method for Navigating the Energy Landscape of Centroidal Voronoi Tessellations

Uses Software

• CGAL
• L-BFGS
• LAMG
• iFEM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient mesh optimization schemes based on optimal Delaunay triangulations
• On the limited memory BFGS method for large scale optimization
• Constrained CVT meshes and a comparison of triangular mesh generators
• A comparative study of sparse approximate inverse preconditioners
• Algebraic multigrid theory: The symmetric case
• Grid generation and optimization based on centroidal Voronoi tessellations
• Optimum quantization and its applications
• Centroidal Voronoi tessellation algorithms for image compression, segmentation, and multichannel restoration
• Advances in Studies and Applications of Centroidal Voronoi Tessellations
• Fast Multilevel CVT-Based Adaptive Data Visualization Algorithm
• Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
• A Multigrid Approach to the Scalar Quantization Problem
• Acceleration schemes for computing centroidal Voronoi tessellations
• Nondegeneracy and Weak Global Convergence of the Lloyd Algorithm in $\mathbb{R}^d$
• Uniform Convergence of a Nonlinear Energy-Based Multilevel Quantization Scheme
• Asymptotically optimal block quantization
• Numerical Optimization
• Centroidal Voronoi Tessellations: Applications and Algorithms
• Quantization
• Incomplete Cholesky Factorizations with Limited Memory
• Two-Grid Discretization Techniques for Linear and Nonlinear PDE<scp>s</scp>
• Least squares quantization in PCM
• A stability criterion to the moment theorem
• On the design of CGAL a computational geometry algorithms library
• Function minimization by conjugate gradients
• Adaptive Multiscale Redistribution for Vector Quantization
• Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
• Methods of conjugate gradients for solving linear systems

This page was built for publication: Fast methods for computing centroidal Voronoi tessellations