The boundary recovery and sliver elimination algorithms of three-dimensional constrained Delaunay triangulation

A boundary recovery and sliver elimination algorithm of the three‐dimensional constrained Delaunay triangulation is proposed for finite element mesh generation. The boundary recovery algorithm includes two main procedures: geometrical recovery procedure and topological recovery procedure. Combining...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal for numerical methods in engineering Ročník 68; číslo 2; s. 192 - 209
Hlavní autoři: Guan, Zhenqun, Song, Chao, Gu, Yuanxian
Médium: Journal Article
Jazyk:angličtina
Vydáno: Chichester, UK John Wiley & Sons, Ltd 08.10.2006
Wiley
Témata:
Algorithms
Boundaries
boundary recovery
Computational techniques
constrained Delaunay triangulation
Constraints
Delaunay triangulation
Exact sciences and technology
Fundamental areas of phenomenology (including applications)
Mathematical methods in physics
Physics
Recovery
sliver element
Slivers
Three dimensional
Topology
Finite element method
constrained Delaunay triangulation
sliver element
Smoothing
boundary recovery
Delaunay triangulation
Modelling
Two phase medium
Topology
Automatic mesh generation
Mesh generation
ISSN:0029-5981, 1097-0207
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A boundary recovery and sliver elimination algorithm of the three‐dimensional constrained Delaunay triangulation is proposed for finite element mesh generation. The boundary recovery algorithm includes two main procedures: geometrical recovery procedure and topological recovery procedure. Combining the advantages of the edges/faces swappings algorithm and edges/faces splittings algorithm presented respectively by George and Weatherill, the geometrical recovery procedure can recover the missing boundaries and guarantee the geometry conformity by introducing fewer Steiner points. The topological recovery procedure includes two phases: ‘dressing wound’ and smoothing, which will overcome topology inconsistency between 3D domain boundary triangles and the volume mesh. In order to solve the problem of sliver elements in the three‐dimensional Delaunay triangulation, a method named sliver decomposition is proposed. By extending the algorithm proposed by Canvendish, the presented method deals with sliver elements by using local decomposition or mergence operation. In this way, sliver elements could be eliminated thoroughly and the mesh quality could be improved in great deal. Copyright © 2006 John Wiley & Sons, Ltd.
Bibliografie:National Natural Science Foundation - No. 10002006; No. 10572032; No. 10032030
ArticleID:NME1707
Special Funds for National Key Basic Research - No. G1999032805
ark:/67375/WNG-2ZJJS6BV-4
istex:91B30B3DCE9C0632B9052DDEB21E72B34BC65D4E
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0029-5981
1097-0207
DOI:10.1002/nme.1707