Volume triangulation from planar cross sections

Computers and Structures

Volumn 72, Issue 1, 1999, Pages 93-108

  Chae, Soo Won ^a   Lee, Gyu Min ^a  

^a Korea University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER AIDED DESIGN; COMPUTER SIMULATION; FINITE ELEMENT METHOD; THREE DIMENSIONAL;

ADVANCING FRONT; MESH GENERATION; PLANAR CONTOURS; TETRAHEDRAL ELEMENTS; TILING;

ALGORITHMS;

EID: 0032667154     PISSN: 00457949     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0045-7949(99)00026-7     Document Type: Article

References (23)

1. Ho-Le K. Finite element mesh generation methods: a review and classification. Comput-Aided Des 1988;20(1):285-91.
2. George PL. Automatic mesh generation. Application to finite element methods. New York: Wiley, 1991.
3. Proceedings of the 6th International Meshing Round-table, Park City, Utah, 13-15 October.
4. Chae SW, Bathe KJ. On automatic mesh construction and mesh refinement in finite element analysis. Comput Struct 1989;32(3/4):911-36.
5. Jin J, Tanner RI. Generation of unstructured tetrahedral meshes by advancing front technique. Int J Numer Meth Engng 1993;36:1805-23.
6. Moller P. On advancing front mesh generation in three dimensions. Int J Numer Meth Engng 1995;38:3551-69.
7. Chae SW, Kim JS. Tetrahedral meshing algorithm using basic operators. In: Proceedings of the 4th International Meshing Roundtable, Albuquerque, NM, 16-17 October, 1995. p. 305-17.
8. Cavendish JC, Field DA, Frey WH. An approach to automatic three-dimensional finite element mesh generator. Int J Numer Meth Engng 1985;21:329-47.
9. Weatherill NP, Hassan O. Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary conditions. Int J Numer Meth Engng 1994;37:2005-39.
10. Borouchaki H, George PL, Lo SH. Optimal Dalaunay point insertion. Int J Numer Meth Engng 1996;39:3407-37.
11. Yerry MA, Shephard MS. Automatic three-dimensional mesh generation by the modified-octree technique. Int J Numer Meth Engng 1984;20:1965-90.
12. Shephard MS, Georges MK. Automatic three-dimensional mesh generation by the finite octree technique. Int J Numer Meth Engng 1991;32:709-49.
13. Ekoule AB, Peyrin FC, Odet CL. A triangulation algorithm from arbitrary shaped multiple planar contours. ACM Trans Graph 1991;10(2):182-99.
14. Mayers D, Skinner S, Sloan K. Surfaces from contours. ACM Trans Graph 1992;11(3):228-58.
15. Soroka BI. Generalized cones from serial sections. Compt Graph Image Process 1981;15:154-66.
16. Keppel E. Approximating complex surfaces by triangulation of contour lines. IBM J Res Devl Jan 1975;19:2-11.
17. Fuchs H, Kedem ZM, Uselton SP. Optimal surface reconstruction from planar contours. ACM 1977;10:693-702.
18. Sloan KR, Painter J. Pessimal guesses may be optimal: a constitutive search result. IEEE Trans Pattern Anal Mach Intell 1988;10(6):949-55.
19. Christiansen HN, Sederberg TW. Conversion of complex contour line definitions into polygonal element mosaics. Compt Graph 1978;12(2):187-92.
20. Boissonnat JD. Shape reconstruction from planar cross sections. Comput Vision Graph Image Process 1988;1:1-29.
21. Bajaj CL, Coyle EJ, Lin KN. Surface and 3D triangular meshes from planar cross sections. In: Proceedings of the 5th International Meshing Round Table, 1996. p. 169-78.
22. ADINA user interface command reference manual. Report ARD 97-2, ADINA R&D Inc., Watertown, MA, 1997.
23. Dey S, Shephard MS, Georges MK. Elimination of the adverse effects of small model features by the local modification of automatically generated meshes. Engng Comput 1997;13:134-52.