Skip to Main content Skip to Navigation
Journal articles

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

Abstract : An unstructured tetrahedral mesh generation algorithm for 3D model with constraints is presented. To automatically generate a tetrahedral mesh for model with constraints, an advancing front algorithm is presented based on conforming constrained Delaunay tetrahedralization (CCDT). To reduce the number of visibility tests between vertices with respect to model faces as well as the computation of constrained Delaunay tetrahedra, a sufficient condition for DT (constrained Delaunay tetrahedralization whose simplexes are all Delaunay) existence is presented and utilized coupled to uniform grid and advancing front techniques in our algorithm. The mesh generator is robust and exhibits a linear time complexity for mechanical models with uniform density distribution.
Document type :
Journal articles
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download

https://hal.inria.fr/inria-00518327
Contributor : Thss Tsinghua Connect in order to contact the contributor
Submitted on : Friday, September 17, 2010 - 4:17:11 AM
Last modification on : Tuesday, June 1, 2021 - 2:34:07 PM
Long-term archiving on: : Saturday, December 18, 2010 - 2:47:42 AM

File

Yi-JunYang2005a.pdf
Files produced by the author(s)

Identifiers

Citation

yi-Jun yang, Jun-Hai yong, Jia-Guang Sun. An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization. Computers and Graphics, Elsevier, 2005, 29 (4), pp.606-615. ⟨10.1016/j.cag.2005.05.011⟩. ⟨inria-00518327⟩

Share

Metrics

Record views

118

Files downloads

2825