Adaptive tetrahedral Mesh generation by constrained Delaunay refinement

International Journal for Numerical Methods in Engineering

Volumn 75, Issue 7, 2008, Pages 856-880

  Si, H ^a  

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

Author keywords

Adaptive mesh refinement; Constrained Delaunay; Delaunay refinement; Tetrahedral mesh generation

Indexed keywords

DIFFERENCE EQUATIONS; DIFFERENTIAL EQUATIONS; DIFFERENTIATION (CALCULUS); FINITE ELEMENT METHOD; FINITE VOLUME METHOD; NUMERICAL ANALYSIS; PARTIAL DIFFERENTIAL EQUATIONS; THREE DIMENSIONAL;

ADAPTIVE MESH REFINEMENT; CONSTRAINED DELAUNAY; DELAUNAY REFINEMENT; FIELD POINTS; TETRAHEDRAL MESH GENERATION;

MESH GENERATION;

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

References (57)

1. Babuška I, Aziz AK. On the angle condition in the finite element method. SIAM Journal on Numerical Analysis 1976; 13(2):214-226.
2. Shewchuk JR. What is a good linear element? Interpolation, conditioning, and quality measures. Proceedings of the l1th International Meshing Roundtable. Sandia National Laboratories: Ithaca, New York, 2002; 115-126.
3. Cavendish JC, Field DA, Frey WH. An approach to automatic three-dimensional finite element mesh generation. International Journal for Numerical Methods in Engineering 1985; 21:329-347.
4. Freitag L, Ollivier-Gooch CF. Tetrahedral mesh improvement using swapping and smoothing. International Journal for Numerical Methods in Engineering 1997; 40(21):3979-4002.
5. Li XY, Teng SH. Generating well-shaped Delaunay meshes in 3D. Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, U.S.A., 2001; 28-37.
6. Frey PJ, George PL. Mesh Generation, Application to Finite Elements. Hermes Science: Oxford, U.K., 2000.
7. Borouchaki H, Laug P, George PL. Parametric surface meshing using a combined advancing-front generalized Delaunay approach. International Journal for Numerical Methods in Engineering 2000; 49:233-259.
8. Fuhrmann J. pdelib, a FVM and FEM toolbox for PDEs. http:// www.wias-berlin.de/software/pdelib, 2007.
9. Si H. TetGen. http://tetgen.berlios.de, 2007.
10. Zienkiewicz OC, Zhu JZ. A simple error estimator and adaptive procedure for practical engineering analysis. International Journal for Numerical Methods in Engineering 1987; 24:337-357.
11. Johnson C, Hansbo P. Adaptive finite element methods in computational mechanics. Computer Methods in Applied Mechanics and Engineering 1992; 101:143-181.
12. Verfürth R. A Review of Posteriori Error Estimation and Adaptive Mesh Refinement Techniques. Wiley: New York, 1996.
13. The Boeing Company. GGNS, the General Geometry Navier-Stokes Solver. The Boeing Company, 2007.
14. Dörfler W. A convergent adaptive algorithm for Poisson's equation. SIAM Journal on Numerical Analysis 1996; 33:1106-1124.
15. Lo SH. A new mesh generation scheme for arbitrary planar domains. International Journal for Numerical Methods in Engineering 1985; 21:1403-1426.
16. Löhner R, Parikh P. Three-dimensional grid generation by the advancing front method. International Journal for Numerical Methods in Fluids 1988; 8:1135-1149.
17. Yerry M, Shephard MS. Automatic three-dimensional mesh generation by the modified-octree technique. International Journal for Numerical Methods in Engineering 1984; 20:1965-1990.
18. Mitchell SA, Vavasis SA. Quality mesh generation in higher dimensions. SIAM Journal on Computing 2000; 29:1334-1370.
19. 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.
20. Chew PL. Guaranteed-quality Delaunay meshing in 3D. Proceedings of the 13th Annual ACM Symposium on Computational Geometry, Nice, France, 1997; 391-393.
21. Shewchuk JR. Delaunay refinement mesh generation. Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1997. Available as Technical Report CMU-CS-97-137.
22. Mavriplis DJ. Unstructured mesh generation and adaptivity. Technical Report 95-26, NASA Contractor Report 195069, ICASE, 1995.
23. Delaunay BN. Sur la sphèe vide. Izvestia Akademii Nauk SSSR, Otdelenie Matematicheskikh i Estestvennykh Nauk 1934; 7:793-800.
24. Schönhardt E. Über die zerlegung von dreieckspolyedern in tetraeder. Mathematische Annalen 1928; 98:309-312.
25. Chazelle B. Convex partition of a polyhedra: a lower bound and worst-case optimal algorithm. SIAM Journal on Computing 1984; 13(3):488-507.
26. Ruppert J, Seidel R. On the difficulty of triangulating three-dimensional non-convex polyhedra. Discrete and Computational Geometry 1992; 7:227-253.
27. Si H, Gärtner K. Meshing piecewise linear complexes by constrained Delaunay tetrahedralizations. Proceedings of the 14th International Meshing Roundtable. Sandia National Laboratories: San Diego, CA, 2005; 147-163.
28. Shewchuk JR. General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties. Discrete and Computational Geometry 2007. http://www.cs.berkeley.edu/~jrs/papers/ cdtjl.pdf.
29. Chew PL. Guaranteed-quality triangular meshes. Technical Report TR 89-983, Department of Computer Science, Cornell University, 1989.
30. Ruppert J. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. Journal of Algorithms 1995; 18(3):548-585.
31. Miller GL, Talmor D, Teng SH, Walkington NJ, Wang H. Control volume meshes using sphere packing: generation, refinement and coarsening. Proceedings of the 5th International Meshing Roundtable. Sandia National Laboratories: Ithaca, New York, 1996.
32. Fuhrmann J, Langmach H. Stability and existence of solutions of time-implicit finite volume schemes for viscous nonlinear conservation laws. Applied Numerical Mathematics 2001; 37:201-230.
33. Cheng SW, Dey T, Edelsbrunner H, Facello MA, Teng SH. Sliver exudation. Journal of Association for Computing Machinery 2000; 47:883-904.
34. Shewchuk JR. Mesh generation for domains with small angles. Proceedings of the 16th Annual Symposium on Computational Geometry, Hong Kong, China, 2000; 1-10.
35. Pav SE, Walkington NJ. Robust three dimensional Delaunay refinement. Proceedings of the 13th International Meshing Roundtable. Sandia National Laboratories: Ithaca, New York, 2004.
36. 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.
37. Yamakawa S, Shimada K. High quality anisotropic tetrahedral mesh generation via packing ellipsoidal bubbles. Proceedings of the 9th International Meshing Roundtable. Sandia National Laboratories: Ithaca, New York, 2000; 263-273.
38. Oudot S, Rineau L, Yvinec M. Meshing volumes bounded by smooth surfaces. Proceedings of the 14th International Meshing Roundtable. Sandia National Laboratories: Ithaca, New York, 2005; 203-220.
39. CGAL. Computational Geometry Algorithms Library. http://www.cgal.org, 2007.
40. George PL, Borouchaki H, Laug P. An efficient algorithm for 3D adaptive meshing. Advances in Engineering Software 2002; 33:377-387.
41. Du Q, Wang D. Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations. International Journal for Numerical Methods in Engineering 2003; 56:1355-1373.
42. Alliez P, Cohen-Steiner D, Yvinec M, Desbrun M. Variational tetrahedral meshing. ACM Transactions on Graphics 2005; 24(3):617-625.
43. Mortenson M. Geometric Modeling. Wiley: College Park, MD, 1985.
44. Mäntylä M. An Introduction to Solid Modeling. Computer Science Press: New York, 1988.
45. d. Discrete and Computational Geometry 1994; 12: 189-202.
46. Edelsbrunner H, Shah NR. Incremental topological flipping works for regular triangulations. Algorithmica 1996; 15:223-241.
47. 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.
48. Shewchuk JR. Constrained Delaunay tetrahedralization and provably good boundary recovery. Proceedings of the 11th International Meshing Roundtable. Sandia National Laboratories: Ithaca, New York, 2002; 193-204.
49. Shewchuk JR. Updating and constructing constrained Delaunay and constrained regular triangulations by flips. Proceedings of the 19th Annual Symposium on Computational Geometry, 2003; 40:181-190.
50. Liu A, Joe B. Relationship between tetrahedron shape measures. BIT Numerical Mathematics 1994; 34:268-297.
51. Dompierre J, Labbe P, Guibault F, Camarero, R. Proposal of benchmarks for 3D unstructured tetrahedral mesh optimization. Proceedings of the 7th International Meshing Roundtable. Sandia National Laboratories: Ithaca, New York, 1998.
52. Miller GL, Talmor D, Teng SH, Walkington NJ, A Delaunay based numerical method for three dimensions: generation, formulation, and partition. Proceedings of the 27th Annual ACM Symposium on Theory of Computing, Las Vegas, Nevada, U.S.A., 1995.
53. Edelsbrunner H, Li XY, Miller GL, Stathopoulos A, Talmor D, Teng SH, Üngör A, Walkington N. Smoothing and cleaning up slivers. Proceedings of the 32nd ACM Symposium on Theory of Computing, Portland, Oregon, U.S.A., 2000; 273-277.
54. Shewchuk JR. Tetrahedral mesh generation by Delaunay refinement. Proceedings of the 14th Annual Symposium on Computational Geometry, Minneapolis Minnesota, U.S.A., 1998; 86-95.
55. Edelsbrunner H, Guoy D. Sink-insertion for mesh improvement. International Journal of Foundations of Computer Science 2002; 13:223-242.
56. Drechsler F, Wolters CH, Dierkes T, Si H, Grasedyck L. A highly accurate full subtraction approach for dipole modeling in EEG source analysis using the finite element method. Technical Report 95, Max-Planck-Institut für Mathematik in den Naturwissenschaften, 2007.
57. Weiss W, Streckenbach T, Hömberg D. WIAS-SHarP, a surface hardening program. http://www.wias-berlin.de/software/sharp, 2007.