Anisotropic Centroidal Voronoi Tessellations and Their Applications
Authors:
- Qiang DuQDQiang Du
- Desheng WangDWDesheng Wang
- 1 January 2005
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 26 (3) , 737-761
Abstract
In this paper, we introduce a novel definition of the anisotropic centroidal Voronoi tessellation (ACVT) corresponding to a given Riemann metric tensor. A directional distance function is used in the definition to simplify the computation. We provide algorithms to approximate the ACVT using the Lloyd iteration and the construction of anisotropic Delaunay triangulation under the given Riemannian metric. The ACVT is applied to the optimization of two-dimensional anisotropic Delaunay triangulation, to the generation of surface CVT, and high-quality triangular mesh on general surfaces. Various numerical examples demonstrating the effectiveness of the proposed method are presented.Keywords
This publication has 26 references indexed in Scilit:
- Parametric surface meshing using a combined advancing-front generalized Delaunay approachInternational Journal for Numerical Methods in Engineering, 2000
- Optimal Point Placement for Mesh SmoothingJournal of Algorithms, 1999
- Adaptive triangular-quadrilateral mesh generationInternational Journal for Numerical Methods in Engineering, 1998
- Anisotropic mesh optimization and its application in adaptivityInternational Journal for Numerical Methods in Engineering, 1997
- Delaunay mesh generation governed by metric specifications. Part I. AlgorithmsFinite Elements in Analysis and Design, 1997
- OPTIMAL DELAUNAY POINT INSERTIONInternational Journal for Numerical Methods in Engineering, 1996
- Fast Delaunay triangulation in three dimensionsComputer Methods in Applied Mechanics and Engineering, 1995
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- An optimal algorithm for constructing the weighted voronoi diagram in the planePattern Recognition, 1984
- Computing Dirichlet tessellationsThe Computer Journal, 1981