Constrained Delaunay tetrahedral mesh generation and refinement

Finite Elements in Analysis and Design

Volumn 46, Issue 1-2, 2010, Pages 33-46

  Si, Hang ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GRAPHICS RENDERING; CONSTRAINED DELAUNAY; CORE ALGORITHMS; DELAUNAY TETRAHEDRALIZATION; FINITE ELEMENT; FINITE ELEMENT ANALYSIS; GEOMETRIC MODELING; PIECEWISE LINEAR; PRACTICAL IMPLEMENTATION; SHAPE ANALYSIS; TETRAHEDRAL MESH GENERATION; TETRAHEDRALIZATION;

DIFFERENTIAL EQUATIONS; MESH GENERATION; PIECEWISE LINEAR TECHNIQUES;

COMPUTER GRAPHICS;

EID: 71549116699     PISSN: 0168874X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.finel.2009.06.017     Document Type: Article

References (57)

1. Babuška I., and Aziz A.K. On the angle condition in the finite element method. SIAM Journal on Numerical Analysis 13 2 (1976) 214-226
2. I. Babuška, J.E. Flaherty, W.D. Henshaw, J.E. Hopcroft, J.E. Oliger, T. Tezduyar, (Eds.), Modeling, mesh generation, and adaptive numerical methods for partial differential equations, in: The IMA Volumes in Mathematics and its Applications, vol. 75, Springer, Berlin, 1995.
3. Babuška I., and Rheinboldt W.C. Adaptive approaches and reliability estimates in finite element analysis. Computer Methods in Applied Mechanics and Engineering 17/18 (1987) 519-540
4. Baker T. Automatic mesh generation for complex three-dimensional regions using a constrained Delaunay triangulation. Engineering with Computers 5 (1989) 161-175
5. M.W. Bern, J.E. Flaherty, M. Luskin (Eds.), Grid generation and adaptive algorithms, in: The IMA Volumes in Mathematics and its Applications, vol. 113, Springer, Berlin, 1999.
6. P.R. Cavalcanti, U.T. Mello, Three-dimensional constrained Delaunay triangulation: a minimalist approach, in: Proceedings of 8th International Meshing Roundtable, Sandia National Laboratories, 1999, pp. 119-129.
7. Cavendish J.C., Field D.A., and Frey W.H. An approach to automatic three-dimensional finite element mesh generation. International Journal for Numerical Methods in Engineering 21 (1985) 329-347
8. Chazelle B. Convex partition of a polyhedra: a lower bound and worst-case optimal algorithm. SIAM Journal on Computing 13 3 (1984) 488-507
9. Chazelle B., and Palios L. Triangulating a nonconvex polytope. Discrete and Computational Geometry 5 (1990) 505-526
10. Cheng S.-W., Dey T.K., Ramos E.A., and Ray T. Quality meshing for polyhedra with small angles. International Journal on Computational Geometry and Applications 15 (2005) 421-461
11. Chew P.L. Constrained Delaunay triangulation. Algorithmica 4 (1989) 97-108
12. P.L. Chew, Guaranteed-quality triangular meshes. Technical Report TR 89-983, Department of Computer Science, Cornell University, 1989.
13. P.L. Chew, Guaranteed-quality Delaunay meshing in 3D, in: Proceedings of 13th Annual ACM Symposium on Computational Geometry, Nice, France, June 1997, pp. 391-393.
14. D. Cohen-Steiner, E.C. De Verdière, M. Yvinec, Conforming Delaunay triangulation in 3D, in: Proceedings of 18th Annual ACM Symposium on Computational Geometry, 2002.
15. Delaunay B.N. Sur la sphère vide. Izvestia Akademii Nauk SSSR, Otdelenie Matematicheskikh i Estestvennykh Nauk 7 (1934) 793-800
16. O. Devillers, M. Teillaud, Perturbations and vertex removal in Delaunay and regular 3D triangulations, Technical Report 5968, INRIA, 2006.
17. Dörfler W. A convergent adaptive algorithm for Poisson's equation. SIAM Journal on Numerical Analysis 33 (1996) 1106-1124
18. Du Q., and Wang D. Boundary recovery for three dimensional conforming Delaunay triangulation. Computer Methods in Applied Mechanics and Engineering 193 (2004) 2547-2563
19. Du Q., and Wang D. Constrained boundary recovery for the three dimensional Delaunay triangulations. International Journal for Numerical Methods in Engineering 61 (2004) 1471-1500
20. Edelsbrunner H. Geometry and Topology for Mesh Generation (2001), Cambridge University Press, England
21. Edelsbrunner H., and Mücke M.P. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithm. ACM Transactions on Graphics 9 1 (1990) 66-104
22. Edelsbrunner H., and Tan T.S. An upper bound for conforming Delaunay triangulations. SIAM Journal on Computing 22 (1993) 527-551
23. P.J. Frey, P.L. George, Mesh Generation, Application to Finite Elements, Hermes Science, Oxford, UK, 2000.
24. George P.L., Borouchaki H., and Laug P. An efficient algorithm for 3D adaptive meshing. Advances in Engineering Software 33 (2002) 377-387
25. George P.L., Borouchaki H., and Saltel E. Ultimate robustness in meshing an arbitrary polyhedron. International Journal for Numerical Methods in Engineering 58 (2003) 1061-1089
26. George P.L., Hecht F., and Saltel E. Automatic mesh generator with specified boundary. Computer Methods in Applied Mechanics and Engineering 92 (1991) 269-288
27. Hazlewood C. Approximating constrained tetrahedralizations. Computer Aided Geometric Design 10 (1993) 67-87
28. Johnson C., and Hansbo P. Adaptive finite element methods in computational mechanics. Computer Methods in Applied Mechanics and Engineering 101 (1992) 143-181
29. Karamete B.K., Beall M.W., and Shephard M.S. Triangulation of arbitrary polyhedra to support automatic mesh generators. International Journal for Numerical Methods in Engineering 49 (2000) 167-191
30. Lee D.T., and Lin A.K. Generalized Delaunay triangulations for planar graphs. Discrete and Computational Geometry 1 (1986) 201-217
31. Lo S.H. A new mesh generation scheme for arbitrary planar domains. International Journal for Numerical Methods in Engineering 21 (1985) 1403-1426
32. Löhner R., and Parikh P. Three-dimensional grid generation by the advancing front method. International Journal for Numerical Methods in Fluids 8 (1988) 1135-1149
33. D.J. Mavriplis, Unstructured mesh generation and adaptivity, Technical Report 95-26, NASA Contractor Report 195069, ICASE, 1995.
34. G.L. Miller, D. Talmor, S.-H. Teng, N.J. Walkington, H. Wang, Control volume meshes using sphere packing: generation, refinement and coarsening, in: Proceedings of 5th International Meshing Roundtable, Sandia National Laboratories, 1996.
35. Mitchell S.A., and Vavasis S.A. Quality mesh generation in higher dimensions. SIAM Journal on Computing 29 (2000) 1334-1370
36. M. Murphy, D.M. Mount, C.W. Gable, A point-placement strategy for conforming Delaunay tetrahedralizations, in: Proceedings of 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 67-74.
37. S.E. Pav, N.J. Walkington, Robust three dimensional Delaunay refinement, in: Proceedings of 13th International Meshing Roundtable, Sandia National Laboratories, 2004.
38. Pébay P., and Frey P.J. A priori Delaunay-conformity. Proceedings of 7th International Meshing Roundtable (1998), Sandia National Laboratories 321-333
39. Ruppert J., and Seidel R. On the difficulty of triangulating three-dimensional non-convex polyhedra. Discrete and Computational Geometry 7 (1992) 227-253
40. Schönhardt E. Über die zerlegung von dreieckspolyedern in tetraeder. Mathematische Annalen 98 (1928) 309-312
41. Shewchuk J.R. A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations. Proceedings of 14th Annual Symposium on Computational Geometry (June 1998) 76-85
42. J.R. Shewchuk, Tetrahedral mesh generation by Delaunay refinement, in: Proceedings of 14th Annual Symposium on Computational Geometry, Minneapolis, Minnesota, USA, June 1998, pp. 86-95.
43. Shewchuk J.R. Sweep algorithm for constructing higher-dimensional constrained Delaunay triangulations. Proceedings of 16th Annual Symposium on Computational Geometry (June 2000) 350-359
44. Shewchuk J.R. Constrained Delaunay tetrahedralization and provably good boundary recovery. Proceedings of 11th International Meshing Roundtable (September 2002), Sandia National Laboratories 193-204
45. Shewchuk J.R. What is a good linear element? Interpolation, conditioning, and quality measures. Proceedings of 11th International Meshing Roundtable (September 2002), Sandia National Laboratories, Ithaca, NY 115-126
46. Shewchuk J.R. Updating and constructing constrained Delaunay and constrained regular triangulations by flips. Proceedings of 19th Annual Symposium on Computational Geometry (June 2003) 181-190
47. Shewchuk J.R. General-dimensional constrained Delaunay and constrained regular triangulations I: combinatorial properties. Discrete and Computational Geometry 39 (2008) 580-637
48. H. Si, TetGen, 〈http://tetgen.berlios.de〉, 2007.
49. Si H. Adaptive tetrahedral mesh generation by constrained Delaunay refinement. International Journal for Numerical Methods in Engineering 75 7 (2008) 856-880
50. H. Si, Three dimensional boundary conforming Delaunay mesh generation, Ph.D. Thesis, Institute of Mathematics, Technische Universität Berlin, 2008.
51. Si H., and Gärtner K. Meshing piecewise linear complexes by constrained Delaunay tetrahedralizations. Proceedings of 14th International Meshing Roundtable (2005), Sandia National Laboratories, San Diego, CA, USA 147-163
52. The Boeing Company, GGNS, The General Geometry Navier-Stokes Solver, 2007, unpublished.
53. Verfürth R. A Review of Posteriori Error Estimation and Adaptive Mesh Refinement Techniques (1996), Wiley-Teubner
54. Weatherill N.P., and Hassan O. Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints. International Journal for Numerical Methods in Engineering 37 (1994) 2005-2039
55. Wright J., and Jack A. Aspects of three-dimensional constrained Delaunay meshing. International Journal for Numerical Methods in Engineering 37 (1994) 1841-1861
56. Yerry M., and Shephard M.S. Automatic three-dimensional mesh generation by the modified-octree technique. International Journal for Numerical Methods in Engineering 20 (1984) 1965-1990
57. G.M. Ziegler, Lectures on polytopes, in: Graduate Texts in Mathematics, vol. 152, Springer, New York, 1995.