3D boundary recovery by constrained Delaunay tetrahedralization

International Journal for Numerical Methods in Engineering

Volumn 85, Issue 11, 2011, Pages 1341-1364

  Si, H ^a   Gartner K ^a  

^a WEIERSTRASS INSTITUTE FOR APPLIED ANALYSIS AND STOCHASTICS   (Germany)

Author keywords

Boundary recovery; Constrained Delaunay tetrahedralization; Steiner points; Tetrahedral mesh generation

Indexed keywords

APPLICATION EXAMPLES; BOUNDARY RECOVERY; CONSTRAINED DELAUNAY; CONSTRAINED DELAUNAY TETRAHEDRALIZATION; DELAUNAY; FUNDAMENTAL PROBLEM; PRACTICAL ALGORITHMS; STEINER POINTS; SUBSEGMENTS; TETRAHEDRAL MESH GENERATION;

MESH GENERATION; RECOVERY; THREE DIMENSIONAL;

ALGORITHMS;

EID: 79951519492     PISSN: 00295981     EISSN: 10970207     Source Type: Journal    
DOI: 10.1002/nme.3016     Document Type: Article

References (57)

1. Lennes NJ. Theorems on the simple finite polygon and polyhedron. American Journal of Mathematics 1911; 33(1/4):37-62.
2. Schönhardt E. Über die zerlegung von dreieckspolyedern in tetraeder. Mathematische Annalen 1928; 98:309-312.
3. Ruppert J, Seidel R. On the difficulty of triangulating three-dimensional non-convex polyhedra. Discrete and Computational Geometry 1992; 7:227-253.
4. Chazelle B. Convex partition of a polyhedra: a lower bound and worse-case optimal algorithm. SIAM Journal on Computing 1984; 13(3):488-507.
5. George PL, Hecht F, Saltel E. Automatic mesh generator with specified boundary. Computer Methods in Applied Mechanics and Engineering 1991; 92:269-288.
6. Weatherill NP, Hassan O. Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints. International Journal for Numerical Methods in Engineering 1994; 37:2005-2039.
7. George PL, Borouchaki H, Saltel E. Ultimate robustness in meshing an arbitrary polyhedron. International Journal for Numerical Methods in Engineering 2003; 58:1061-1089.
8. Chazelle B, Palios L. Triangulating a nonconvex polytope. Discrete and Computational Geometry 1990; 5:505-526.
9. Dey TK. Triangulating and CSG representation of polyhedra with arbitrary genus. Proceedings of 7th Annual ACM Symposium on Computational Geometry, North Conway, New Hampshire, U.S.A., 1991; 364-372.
10. Chazelle B, Shouraboura N. Bounds on the size of tetrahedralizations. Discrete and Computational Geometry 1995; 14:429-444.
11. Joe B. Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions. International Journal for Numerical Methods in Engineering 1994; 37:693-713.
12. Hershberger JE, Snoeyink J. Erased arrangements of lines and convex decompositions of polyhedra. Computational Geometry 1998; 9(3):129-143.
13. Edelsbrunner H. Algorithms in Combinatorial Geometry. Springer: Heidelberg, 1987.
14. De Berg M, Van Kreveld M, Overmars M, Schwarzkopf O. Computational Geometry: Algorithms and Applications. Springer: Heidelberg, 1997.
15. Pébay P, Frey PJ. A Priori Delaunay-conformity. Proceedings of 7th International Meshing Roundtable, Sandia National Laboratories, 1998; 321-333.
16. Murphy M, Mount DM, Gable CW. A point-placement strategy for conforming Delaunay tetrahedralizations. Proceedings of 11th Annual ACM-SIAM Symposium on Discrete Algorithms, Hong Kong, 2000; 67-74.
17. Cohen-Steiner D, De Verdière EC, Yvinec M. Conforming Delaunay triangulation in 3D. Proceedings of 18th Annual ACM Symposium on Computational Geometry, Barcelona, Spain, 2002.
18. Lee DT, Lin AK. Generalized Delaunay triangulations for planar graphs. Discrete and Computational Geometry 1986; 1:201-217.
19. Chew PL. Guaranteed-quality triangular meshes. Technical Report TR 89-983, Department of Computer Science, Cornell University, 1989.
20. Shewchuk JR. Constrained Delaunay tetrahedralization and provably good boundary recovery. Proceedings of 11th International Meshing Roundtable, Sandia National Laboratories, 2002; 193-204.
21. Si H, Gärtner K. Meshing piecewise linear complexes by constrained Delaunay tetrahedralizations. Proceedings of 14th International Meshing Roundtable, San Diego, CA, U.S.A., 2005; 147-163.
22. Baker T. Automatic mesh generation for complex three-dimensional regions using a constrained Delaunay triangulation. Engineering with Computers 1989; 5:161-175.
23. Hazlewood C. Approximating constrained tetrahedralizations. Computer Aided Geometric Design 1993; 10:67-87.
24. Si H. Adaptive tetrahedral mesh generation by constrained Delaunay refinement. International Journal for Numerical Methods in Engineering 2008; 75(7):856-880.
25. Shewchuk JR. Tetrahedral mesh generation by Delaunay refinement. Proceedings of 14th Annual Symposium on Computational Geometry, Minneapolis, MN, U.S.A., 1998; 86-95.
26. Si H. Three dimensional boundary conforming Delaunay mesh generation. Ph.D. Thesis, Institute of Mathematics, Technische Universität Berlin, 2008. Available from.
27. Shewchuk JR. Updating and constructing constrained Delaunay and constrained regular triangulations by flips. Proceedings of 19th Annual Symposium on Computational Geometry, San Diego, CA, U.S.A., 2003; 181-190.
28. Shewchuk JR. A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations. Proceedings of 14th Annual Symposium on Computational Geometry, Minneapolis, MN, U.S.A., 1998; 76-85.
29. Edelsbrunner H. Geometry and Topology for Mesh Generation. Cambridge University Press: England, 2001.
30. Miller GL, Talmor D, Teng SH, Walkington NJ, Wang H. Control volume meshes using sphere packing: Generation, refinement and coarsening. Proceedings of 5th International Meshing Roundtable, Sandia National Laboratories, 1996.
31. Huang W. Measuring mesh qualities and application to variational mesh adaptation. SIAM Journal on Scientific Computing 2005; 26(5):1643-1666.
32. Delaunay BN. Sur la sphère vide. Izvestia Akademii Nauk SSSR, Otdelenie Matematicheskikh i Estestvennykh Nauk 1934; 7:793-800.
33. d. Discrete and Computational Geometry 1994; 12:189-202.
34. Clarkson KL, Shor PW. Applications of random sampling in computational geometry, II. Discrete and Computational Geometry 1989; 4:387-421.
35. Bowyer A. Computing Dirichlet tessellations. Computer Journal 1987; 24(2):162-166.
36. Watson DF. Computing the n-dimensional Delaunay tessellations with application to Voronoi polytopes. Computer Journal 1987; 24(2):167-172.
37. Edelsbrunner H, Shah NR. Incremental topological flipping works for regular triangulations. Algorithmica 1996; 15:223-241.
38. Chan TM, Snoeyink J. Primal dividing and dual pruning: output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams. Discrete and Computational Geometry 1997; 18(4):433-454.
39. Edelsbrunner H, Tan TS. An upper bound for conforming Delaunay triangulations. SIAM Journal on Computing 1993; 22:527-551.
40. Chew PL. Constrained Delaunay triangulation. Algorithmica 1989; 4:97-108.
41. Shewchuk JR. General-dimensional constrained Delaunay and constrained regular triangulations I: combinatorial properties. Discrete and Computational Geometry 2008; 39:580-637.
42. Edelsbrunner H. An acyclicity theorem for cell complex in d dimension. Combinatorica 1990; 10(3):251-260.
43. Edelsbrunner H, Mücke M. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithm. ACM Transactions on Graphics 1990; 9(1):66-104.
44. Devillers O, Teillaud M. Perturbations and vertex removal in Delaunay and regular 3D triangulations. Technical Report 5968, INRIA 2006.
45. Ruppert J. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. Journal of Algorithms 1995; 18(3):548-585.
46. Ollivier-Gooch CF. Coarsening unstructured meshes by edge contraction. International Journal for Numerical Methods in Engineering 2003; 57:391-414.
47. Liu A, Baida M. How far flipping can go towards 3D conforming/constrained triangulation. Proceedings of 9th International Meshing Roundtable, Sandia National Laboratories, 2000; 307-315.
48. Freitag L, Ollivier-Gooch CF. Tetrahedral mesh improvement using swapping and smoothing. International Journal for Numerical Methods in Engineering 1997; 40(21):3979-4002.
49. Klingner BM, Shewchuk JR. Aggressive Tetrahedral Mesh Improvement. Proceedings of 16th International Meshing Roundtable, Sandia National Laboratories, 2007; 3-23.
50. Si H. TetGen. Available from:, 2007.
51. INRIA. GAMMA, automatic mesh generation and adaption methods. Available from:, 2007.
52. Boissonnat JD, Oudout S. Provably good surface sampling and meshing of surfaces. Graphical Models 2005; 67:405-451.
53. Cheng SW, Dey TK, Ramos EA. Delaunay refinement for piecewise smooth complexes. Proceedings of 18th Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 2007; 1096-1105.
54. Amenta N, Bern M. Surface reconstruction by Voronoi filtering. Discrete and Computational Geometry 1999; 22:481-504.
55. Edelsbrunner H. 180 wrapped tubes. Available from.
56. Cheng SW, Dey TK, Ramos EA, Ray T. Quality meshing for polyhedra with small angles. International Journal on Computational Geometry and Applications 2005; 15:421-461.
57. Pav SE, Walkington NJ. Robust three dimensional Delaunay refinement. Proceedings of 13th International Meshing Roundtable, Sandia National Laboratories, 2004.