Hits:

Indexed by:期刊论文

Date of Publication:2006-10-08

Journal:INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING

Included Journals:SCIE、EI、Scopus

Volume:68

Issue:2

Page Number:192-209

ISSN No.:0029-5981

Key Words:constrained Delaunay triangulation; boundary recovery; sliver element

Abstract: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 (c) 2006 John Wiley & Sons, Ltd.