Tetrahedral mesh generation for solids based on alternating sum of volumes

Citation
K. Tang et al., Tetrahedral mesh generation for solids based on alternating sum of volumes, COMPUT IND, 41(1), 2000, pp. 65-81
Citations number
38
Categorie Soggetti
Computer Science & Engineering
Journal title
COMPUTERS IN INDUSTRY
ISSN journal
01663615 → ACNP
Volume
41
Issue
1
Year of publication
2000
Pages
65 - 81
Database
ISI
SICI code
0166-3615(200001)41:1<65:TMGFSB>2.0.ZU;2-3
Abstract
Decomposition of a three-dimensional non-convex polyhedral object into tetr ahedra using few or no 'Steiner' points assumes both theoretical and practi cal importance. It has been known that the determination of whether a polyh edron can be tetrahedralized is NP-complete. This prompts the investigation of the tetrahedralization of special classes of polyhedra, including conve x, star-shaped, monotone, and isothetic. This paper identifies a special cl ass of polyhedra that can be tetrahedralized without using 'Steiner' points . The proposed tetrahedralization algorithm utilizes a structure provided b y the alternating sum of volumes process (a convex decomposition method) so that a complex solid object can first be decomposed into a set of simpler objects, namely conjuncts. The concatenation of the tetrahedralization of t hese conjuncts gives rise to the tetrahedralization of the original solid o bject. (C) 2000 Elsevier Science B.V. AU rights reserved.