An algorithmnext term for previous termtetrahedral mesh generation based on conforming constrained Delaunay tetrahedralizationnext term

Jia-Guang Sun 1 Yi-Jun Yang 1 Jun-Hai Yong 1
1 CAD - Computer Aided Design
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : An unstructured previous termtetrahedral mesh generation algorithmnext term for 3D model with constraints is presented. To automatically generate a previous termtetrahedral meshnext term for model with constraints, an advancing front previous termalgorithmnext term is presented previous termbased on conforming constrained Delaunay tetrahedralizationnext term (CCDT). To reduce the number of visibility tests between vertices with respect to model faces as well as the computation of previous termconstrained Delaunaynext term tetrahedra, a sufficient condition for DT (previous termconstrained Delaunay tetrahedralizationnext term whose simplexes are all previous termDelaunay)next term existence is presented and utilized coupled to uniform grid and advancing front techniques in our previous termalgorithm. The meshnext term generator is robust and exhibits a linear time complexity for mechanical models with uniform density distribution.
Type de document :
Article dans une revue
Computers and Graphics, Elsevier, 2005, 29 (4), pp.606-615. 〈10.1016/j.cag.2005.05.011〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00142825
Contributeur : Chine Publications Liama <>
Soumis le : lundi 23 avril 2007 - 10:04:24
Dernière modification le : mercredi 10 octobre 2018 - 14:28:07

Lien texte intégral

Identifiants

Collections

Citation

Jia-Guang Sun, Yi-Jun Yang, Jun-Hai Yong. An algorithmnext term for previous termtetrahedral mesh generation based on conforming constrained Delaunay tetrahedralizationnext term. Computers and Graphics, Elsevier, 2005, 29 (4), pp.606-615. 〈10.1016/j.cag.2005.05.011〉. 〈inria-00142825〉

Partager

Métriques

Consultations de la notice

120