Tetrahedral meshes from planar cross-sections

Computer Methods in Applied Mechanics and Engineering

Volumn 179, Issue 1-2, 1999, Pages 31-52

  Bajaj, Chandrajit L ^a   Coyle, Edward J ^b   Lin, Kwun Nan ^b  

^a University of Texas at Austin   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; COMPUTERIZED TOMOGRAPHY; MAGNETIC RESONANCE IMAGING; MEDICAL IMAGING; THREE DIMENSIONAL COMPUTER GRAPHICS; ULTRASONIC IMAGING;

ADVANCING FRONT TECHNIQUE; NON CONVEX POLYHEDRA; PLANAR SECTION CONTOURS; PRISMATOIDS; SURFACE TRIANGULAR MESH; TETRAHEDRA;

FINITE ELEMENT METHOD;

EID: 0033170336     PISSN: 00457825     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0045-7825(99)00030-4     Document Type: Article

References (26)

1. Bajaj C., Coyle E., Lin K. Arbitrary topology shape reconstruction from planar cross sections. Graphical Models and Image Processing. 58(6):1996;524-543.
2. Bajaj C., Dey T.K. Convex decomposition of polyhedra and robustness. SIAM J. Comput. 21(2):1992;339-364.
3. M. Bern, D. Eppstein, in: D.-Z. Du, F.K. Hwang (Eds.), Mesh Generation and Optimal Triangulation, Computing in Euclidean Geometry, World Scientific, Singapore, 1992, p. 23-90.
4. W.H. Beyer, CRC Standard Mathematical Tables, 28th ed., CRC Press, Boca Raton, Florida, 1987.
5. Boissonnat J.D. Shape reconstruction from planar cross sections. Comput. Vision and Image Proc. 44:1988;1-29.
6. Cavendish J.C., Field D.A., Frey W.H. An approach to automatic three-dimensional finite element mesh generation. Int. J. for Numer. Meth. in Eng. 21:1985;329-337.
7. CG Impact Task Froce Report. Application challenges to computational geometry. Technical report, Technical Report TR-521-96, Princeton University, http://www.cs.princeton.edu/ chazelle/taskforce/CGreport.ps, April 1996.
8. Chae S., Bathe K. On automatic mesh construction and mesh refinement in finite element analysis. Comput. and Struct. 32(34):1989;911-936.
9. Chazelle B., Palios L. Triangulating a non-convex polytope. Discrete Comput. Geom. 5:1990;505-526.
10. Dannelongue H.H., Tanguy P.A. Three-dimensional adaptive finite element computations and applications to non-newtonian fluids. Int. J. for Numer. Meth. in Fluids. 13:1991;145-165.
11. Field D.A. The legacy of automatic mesh generation from solid modeling. Comput. Aided Geometric Design. 12:1995;651-673.
12. B. Geiger, Three-dimensional modeling of human organs and its application to diagnosis and surgical planning, Technical Report, 2105, INRIA, France, 1993.
13. George P.L., Seveno E. The advancing-front mesh generation method revisited. Int. J. for Numer. Meth. in Eng. 37:1994;3605-3619.
14. Jin H., Tanner R.I. Generation of unstructured tetrahedral meshes by advancing front technique. Int. J. for Numer. Meth. in Eng. 36:1993;1805-1823.
15. Joe B. Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions. Int. J. for Numer. Meth. in Eng. 37:1994;693-713.
16. Johnston B.P., Sullivan J.M. A normal offsetting technique for automatic mesh generation in three dimensions. Int. J. for Numer. Meth. in Eng. 36:1993;1717-1734.
17. K. Lin, Surface and 3D triangular meshes from planar cross sections, Ph.D. Thesis, Purdue University, 1997.
18. Lo S.H. A new mesh generation scheme for arbitrary planar domains. Int. J. for Numer. Meth. in Eng. 21:1985;1403-1426.
19. Lo S.H. Volume discretization into tetrahedra - II. 3D triangulation by advancing front approach. Comput. and Struct. 39(5):1991;501-511.
20. Lohner R., Parikh P. Generation of three-dimensional unstructured grids by the advancing-front method. Int. J. for Numer. Meth. in Eng. 8:1988;1135-1149.
21. Marcum D.L., Weatherill N.P. Unstructured grid generation using iterative point insertion and local reconnection. AIAA J. 33(9):1995;1619-1625.
22. Moller P., Hansbo P. On advancing front mesh generation in three dimensions. Int. J. for Numer. Meth. in Eng. 38:1995;3551-3569.
23. J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, Oxford, 1987.
24. Peraire J., Peiro J., Formaggia L., Morgan K., Zienkiewicz O.C. Finite element euler computations in three dimensions. Int. J. for Numer. Meth. in Eng. 26:1988;2135-2159.
25. J. Ruppert, R. Seidel, On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra, in: Proceedings 5th Annual ACM Symposium Comput. Geom., 1989, pp. 380-392.
26. Weatherill N.P., Hassan O. Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints. Int. J. for Numer. Meth. in Eng. 37:1994;2005-2039.