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

被引:53
作者
Du, Q [1 ]
Wang, DS
机构
[1] Penn State Univ, Dept Math, University Pk, PA 16802 USA
[2] Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
[3] Xiangtan Univ, Dept Math, Xiangtan 411105, Peoples R China
[4] Univ Coll Swansea, Sch Engn, Civil & Computat Engn Ctr, Swansea SA2 8PP, W Glam, Wales
关键词
optimal triangulation; centroidal Voronoi tessellation; Gersho's conjecture; optimal vector quantizer; mesh generation and optimization;
D O I
10.1016/j.camwa.2004.12.008
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Optimal centroidal Voronoi tessellations have important applications in many different areas such as vector quantization, data and image processing, clustering analysis, and resource management. In the three-dimensional Euclidean space, they are also useful to the mesh generation and optimization. In this paper, we conduct extensive numerical simulations to investigate the asymptotic structures of optimal centroidal Voronoi tessellations for a given domain. Such a problem is intimately related to the famous Gersho's conjecture, for which a full proof is still not available. We provide abundant evidence to substantiate the claim of the conjecture: the body-centered-cubic lattice (or Par6) based centroidal Voronoi tessellation has the lowest cost (or energy) per unit volume and is the most likely congruent cell predicted by the three-dimensional Gersho conjecture. More importantly, we probe the various properties of this optimal configuration including its dual triangulations which bear significant consequences in applications to three-dimensional high quality meshing. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1355 / 1373
页数:19
相关论文
共 38 条
[1]   THE OPTIMAL LATTICE QUANTIZER IN 3 DIMENSIONS [J].
BARNES, ES ;
SLOANE, NJA .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1983, 4 (01) :30-41
[2]   VORONOI REGIONS OF LATTICES, 2ND MOMENTS OF POLYTOPES, AND QUANTIZATION [J].
CONWAY, JH ;
SLOANE, NJA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (02) :211-226
[3]   Constrained boundary recovery for three dimensional Delaunay triangulations [J].
Du, Q ;
Wang, DS .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2004, 61 (09) :1471-1500
[4]   Boundary recovery for three dimensional conforming Delaunay triangulation [J].
Du, Q ;
Wang, DS .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2004, 193 (23-26) :2547-2563
[5]   Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations [J].
Du, Q ;
Wang, DS .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2003, 56 (09) :1355-1373
[6]   Meshfree, probabilistic determination of point sets and support regions for meshless computing [J].
Du, Q ;
Gunzburger, M ;
Ju, LL .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2002, 191 (13-14) :1349-1366
[7]   Grid generation and optimization based on centroidal Voronoi tessellations [J].
Du, Q ;
Gunzburger, M .
APPLIED MATHEMATICS AND COMPUTATION, 2002, 133 (2-3) :591-607
[8]   Centroidal Voronoi tessellations: Applications and algorithms [J].
Du, Q ;
Faber, V ;
Gunzburger, M .
SIAM REVIEW, 1999, 41 (04) :637-676
[9]  
DU Q, OPTIMAL 3D TETRAHEDR
[10]  
DU Q, CONVERGENCE PROPERTI