A simple geometric method for navigating the energy landscape of centroidal Voronoi tessellations
From MaRDI portal
(Redirected from Publication:4997348)
Abstract: Finding optimal (or low energy) centroidal Voronoi tessellations (CVTs) on a 2D domain is a challenging problem. One must navigate an energy landscape whose desirable critical points have sufficiently small basins of attractions that they are inaccessible with Monte-Carlo initialized gradient descent methods. We present a simple deterministic method for efficiently navigating the energy landscape in order to it access these low energy CVTs. The method has two parameters and is based upon each generator moving away from the closest neighbor by a certain distance. We give a statistical analysis of the performance of this hybrid method comparing with the results of a large number of runs for both Lloyd's method and state of the art quasi-Newton methods. Stochastic alternatives are also considered.
Recommendations
- Fast methods for computing centroidal Voronoi tessellations
- scientific article; zbMATH DE number 6164563
- Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
- Advances in studies and applications of centroidal Voronoi tessellations
- Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations
Cites work
- A fast multilevel CVT-based adaptive data visualization algorithm
- A short analytic proof of Fejes Tóth's theorem on sums of moments
- A survey of nonlinear conjugate gradient methods
- Acceleration schemes for computing centroidal Voronoi tessellations
- Advances in studies and applications of centroidal Voronoi tessellations
- Asymptotically optimal block quantization
- Bounds on the geometric complexity of optimal centroidal Voronoi tesselations in 3D
- Centroidal Voronoi Tessellations: Applications and Algorithms
- Computing 3D Periodic Triangulations
- Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
- Fast methods for computing centroidal Voronoi tessellations
- Foundations of quantization for probability distributions
- scientific article; zbMATH DE number 3889235 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 2066953 (Why is no real title available?)
- scientific article; zbMATH DE number 1455125 (Why is no real title available?)
- scientific article; zbMATH DE number 6164563 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3083197 (Why is no real title available?)
- Incomplete Cholesky Factorizations with Limited Memory
- Least squares quantization in PCM
- Linear finite element superconvergence on simplicial meshes
- MONTE CARLO METHODS FOR SOLVING MULTIVARIABLE PROBLEMS
- Nondegeneracy and Weak Global Convergence of the Lloyd Algorithm in $\mathbb{R}^d$
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- Perimeter-minimizing pentagonal tilings
- Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations
- The crystallization conjecture: a review
- The hexagon theorem
- The optimal centroidal Voronoi tessellations and the Gersho's conjecture in the three-dimensional space
- The Optimal Lattice Quantizer in Three Dimensions
- Voronoi regions of lattices, second moments of polytopes, and quantization
Cited in
(4)
This page was built for publication: A simple geometric method for navigating the energy landscape of centroidal Voronoi tessellations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4997348)
