An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization

Computers and Graphics (Pergamon)

Volumn 29, Issue 4, 2005, Pages 606-615

  Yang, Yi Jun ^a   Yong, Jun Hai ^a   Sun, Jia Guang ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

CCDT; Finite element methods; Octree

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FINITE ELEMENT METHOD; MATHEMATICAL MODELS; THREE DIMENSIONAL;

CCDT; MESH GENERATION; OCTREE;

COMPUTER GRAPHICS;

EID: 24144482668     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cag.2005.05.011     Document Type: Article

References (30)

1. C. Susanne, L. Brenner, and L.R. Scott The mathematical theory of finite element methods 1994 Springer Berlin
2. J. Martins, E. Pires, R. Salvado, and P. Dinis A numerical model of passive and active behavior of skeletal muscles Computer Methods in Applied Mechanics and Engineering 151 1998 419 433
3. M. Bro-Nielsen, and S. Cotin Real-time volumetric deformable models for surgery simulations using finite elements and condensation Computer Graphics Forum 15 3 1996 57 66
4. Ganovelli F, Cignoni P, Montani C, Scopigno R. A multiresolution model for soft objects supporting interactive cuts and lacerations. Computer Graphics Forum 2000;19(3):271-82.
5. G. Farin Geometric modeling: algorithms and new trends 1987 SIAM Philadelphia, PA
6. J.R. Shewchuk Constrained Delaunay tetrahedralizations and provably good boundary recovery Eleventh international meshing roundtable. Ithaca, New York 2002 193 204
7. Cheng SW, Poon SH. Graded conforming Delaunay tetrahedralization with bounded radius-edge ration. Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms. 2003. pp. 295-304.
8. Li XY. Spacing control and sliver-free Delaunay mesh. Proceedings of the ninth international meshing roundtable. 2000. p. 295-306.
9. Murphy M, Mount DM, Gable CW. A point-placement strategy for conforming Delaunay tetrahedralization. Proceedings of the eleventh annual symposium on discrete algorithms. 2000. p. 67-74.
10. R. Radovitzky, and M. Ortiz Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front Delaunay triangulation Computer Methods in Applied Mechanics and Engineering 187 2000 543 569
11. Shewchuk JR. Tetrahedral mesh generation by Delaunay refinement. Proceedings of the fourteenth annual symposium on computational geometry. 1998. p. 86-95.
12. Fuchs A. Automatic grid generation with almost regular Delaunay tetrahedra. Proceedings of the seventh international meshing roundtable. 1998. p. 133-48.
13. Molino N, Bridson R, Teran J, Fedkiw R. A crystalline, red green strategy for meshing highly deformable objects with tetrahedra. Twelfth international meshing roundtable. 2003. p. 103-14.
14. R. Perucchio, M. Saxena, and A. Kela Automatic mesh generations from solid models based on recursive spatial decompositions International Journal for Numerical Methods in Engineering 28 1989 2469 2501
15. W.J. Schroeder, and M.S. Shephard A combined octree/Delaunay method for fully automatic 3-d mesh generation International Journal for Numerical Methods in Engineering 29 1990 37 55
16. L.P. Chew Constrained Delaunay triangulations Algorithmica 4 1989 97 108
17. Klein R. Construction of the constrained Delaunay triangulation of a polygonal domain. CAD Systems Development 1995:313-26.
18. D.T. Lee, and A.K. Lin Generalized delaunay triangulations for planar graphs Discrete & Computational Geometry 1 1986 201 217
19. E. Schönhardt Über die Zerlegung von Dreieckspolyedern in Tetraeder Mathematische Annalen 98 1928 309 312
20. H. Edelsbrunner, and E.P. Mücke Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms ACM Transactions on Graphics 9 1 1990 66 104
21. M.S. Shephard, and M.K. Georges Automatic three-dimensional mesh generation by the finite octree technique International Journal for Numerical Methods in Engineering 32 4 1991 709 749
22. J.C. Cavendish, D.A. Field, and W.H. Frey An approach to automatic three-dimensional finite element mesh generation International Journal for Numerical Methods in Engineering 21 1985 329 347
23. J.L. Bentley, B.W. Weide, and A.C. Yao Optimal expected-time algorithms for closest point problems ACM Transactions on Mathematical Software 6 4 1980 563 580
24. Fang TP, Piegl LA. Delaunay triangulation using a uniform grid. IEEE Computer Graphics and Applications 1993:36-47.
25. A. Bowyer Computing dirichlet tessellations Computer Journal 24 2 1981 162 166
26. L. Kenneth, Clarkson, and W.S. Peter Applications of random sampling in computational geometry II Discrete & Computational Geometry 4 1 1989 387 421
27. D.F. Watson Computing the n -dimensional Delaunay tessellation with application to Voronoi polytopes Computer Journal 24 2 1981 167 172
28. Freitag LA, Carl OG. A comparison of tetrahedral mesh improvement techniques. Proceedings of the fifth international meshing roundtable. 1996. p. 87-100.
29. B. Joe Construction of three-dimensional improved-quality triangulations using local transformations SIAM Journal on Scientific and Statistical Computing 16 6 1995 1292 1307
30. B. Joe Three-dimensional triangulations from local transformations SIAM Journal on Scientific and Statistical Computing 10 1989 718 741