Complex conforming Delaunay triangulation

A novel algorithm of conforming Delaunay triangulation for curved geometry is presented in the paper. A progress has been made for the problem puzzled Delaunay refinement where curved constraints cannot be accepted as input directly. The algorithm is based on a new sufficient condition for the existence of constraints in triangulation. It requires computing only the intersection between constraints and Voronoi edges or faces instead of the circum-sphere of curved constraint. For the termination of the algorithm when small input angles exist in constraints, a weighted method is applied to ensure that the algorithm can terminate under any input. Some two-dimensional and three-dimensional results are also presented. It is shown that the algorithm has the capability of dealing with both linear and nonlinear constraints in a consistent way, without the need of maintaining triangular meshes on face constraints.

[1]  L. Paul Chew,et al.  Guaranteed-quality mesh generation for curved surfaces , 1993, SCG '93.

[2]  Adrian Bowyer,et al.  Computing Dirichlet Tessellations , 1981, Comput. J..

[3]  Noel Walkington,et al.  Robust Three Dimensional Delaunay Refinement , 2004, IMR.

[4]  Herbert Edelsbrunner,et al.  Sliver exudation , 1999, SCG '99.

[5]  Noel Walkington,et al.  Delaunay Refinement by Corner Lopping , 2005, IMR.

[6]  Wu Zhuang.  Algorithm for Constructing the Regular Triangulation of a Set of Weighted Points in E~d , 2002 .

[7]  Jonathan Richard Shewchuk,et al.  Delaunay refinement algorithms for triangular mesh generation , 2002, Comput. Geom..

[8]  Herbert Edelsbrunner,et al.  Triangulating Topological Spaces , 1997, Int. J. Comput. Geom. Appl..

[9]  Steve Oudot,et al.  Provably Good Surface Sampling and Approximation , 2003, Symposium on Geometry Processing.

[10]  Mariette Yvinec,et al.  Conforming Delaunay triangulations in 3D , 2002, SCG '02.

[11]  Sheung-Hung Poon,et al.  Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio , 2003, SODA '03.

[12]  Herbert Edelsbrunner,et al.  Sliver exudation , 2000, J. ACM.

[13]  Jim Ruppert,et al.  A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation , 1995, J. Algorithms.

[14]  Tamal K. Dey,et al.  Sampling and Meshing a Surface with Guaranteed Topology and Geometry , 2007, SIAM J. Comput..

[15]  L. Paul Chew,et al.  Guaranteed-Quality Triangular Meshes , 1989 .

[16]  D. F. Watson.  Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..

[17]  Jonathan Richard Shewchuk,et al.  Tetrahedral mesh generation by Delaunay refinement , 1998, SCG '98.

[18]  Tamal K. Dey,et al.  Quality meshing for polyhedra with small angles , 2004, SCG '04.

[19]  Charles Boivin,et al.  Guaranteed‐quality triangular mesh generation for domains with curved boundaries , 2002 .

[20]  David M. Mount,et al.  A point-placement strategy for conforming Delaunay tetrahedralization , 2000, SODA '00.