The optimal centroidal Voronoi tessellations and the Gersho's conjecture in the three-dimensional space

DOI10.1016/j.camwa.2004.12.008zbMath1077.65019OpenAlexW1975209811WikidataQ123028660 ScholiaQ123028660MaRDI QIDQ2387368

Desheng Wang, Qiang Du

Publication date: 2 September 2005

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2004.12.008

zbMATH Keywords

numerical examplemesh optimizationMesh generationCentroidal Voronoi TessellationGersho's conjectureOptimal triangulationOptimal vector quantizer

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items (21)

Kernel-based adaptive sampling for image reconstruction and meshing ⋮ Efficient Time Integration of Maxwell's Equations with Generalized Finite Differences ⋮ Topology optimization using polytopes ⋮ Approximation by finitely supported measures ⋮ Linear finite element superconvergence on simplicial meshes ⋮ Generalized wave propagation problems and discrete exterior calculus ⋮ \texttt{PolyMesher}: a general-purpose mesh generator for polygonal elements written in Matlab ⋮ A physics-motivated centroidal Voronoi particle domain decomposition method ⋮ Optimization of Subdivision Invariant Tetrahedra ⋮ An optimal particle setup method with centroidal Voronoi particle dynamics ⋮ An isotropic unstructured mesh generation method based on a fluid relaxation analogy ⋮ Asymptotic optimality of the triangular lattice for a class of optimal location problems ⋮ Adaptive Anisotropic Unstructured Mesh Generation Method Based on Fluid Relaxation Analogy ⋮ Centroidal Voronoi tessellation-based finite element superconvergence ⋮ Recent progress in robust and quality Delaunay mesh generation ⋮ Superconvergence analysis for the explicit polynomial recovery method ⋮ Three-dimensional random Voronoi tessellations: from cubic crystal lattices to Poisson point processes ⋮ Geometric Self-Assembly of Rigid Shapes: A Simple Voronoi Approach ⋮ On high-resolution adaptive sampling of deterministic signals ⋮ Bounds on the geometric complexity of optimal centroidal Voronoi tesselations in 3D ⋮ A Simple Geometric Method for Navigating the Energy Landscape of Centroidal Voronoi Tessellations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boundary recovery for three dimensional conforming Delaunay triangulation
• EQSM: an efficient high-quality surface grid generation method based on remeshing
• Meshfree, probabilistic determination of point sets and support regions for meshless computing
• Tiling space and slabs with acute tetrahedra.
• Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation
• Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations
• Grid generation and optimization based on centroidal Voronoi tessellations
• The hexagon theorem
• Voronoi regions of lattices, second moments of polytopes, and quantization
• Asymptotically optimal block quantization
• Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations
• Constrained Centroidal Voronoi Tessellations for Surfaces
• On quantization with the Weaire-Phelan partition
• A Zador-like formula for quantizers based on periodic tilings
• Centroidal Voronoi Tessellations: Applications and Algorithms
• Quantization
• Least squares quantization in PCM
• The Optimal Lattice Quantizer in Three Dimensions
• Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
• Constrained boundary recovery for three dimensional Delaunay triangulations

This page was built for publication: The optimal centroidal Voronoi tessellations and the Gersho's conjecture in the three-dimensional space