论文信息 - Conforming Delaunay triangulations in 3D

Conforming Delaunay triangulations in 3D

We describe an algorithm which, for any piecewise linear complex (PLC) in 3D, builds a Delaunay triangulation conforming to this PLC.The algorithm has been implemented, and yields in practice a relatively small number of Steiner points due to the fact that it adapts to the local geometry of the PLC. It is, to our knowledge, the first practical algorithm devoted to this problem.

Mariette Yvinec | David Cohen-Steiner | Éric Colin de Verdière | M. Yvinec | D. Cohen-Steiner

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

[2] Tiow Seng Tan,et al. An upper bound for conforming Delaunay triangulations , 1992, SCG '92.

[3] Mariette Yvinec,et al. Algorithmic geometry , 1998 .

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

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

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