Boundary-conforming tetrahedral mesh generation for arbitrary polyhedron
Received:May 16, 2010  Revised:June 22, 2011
View Full Text  View/Add Comment  Download reader
DOI:10.7511/jslx20122009
KeyWord:mesh generation  delaunay triangulation  tetrahedral elements  conforming boundary recovery
        
AuthorInstitution
刘岩 大连理工大学 工程力学系 工业装备结构分析国家重点实验室, 大连
关振群 大连理工大学 工程力学系 工业装备结构分析国家重点实验室, 大连
张洪武 大连理工大学 工程力学系 工业装备结构分析国家重点实验室, 大连
Hits: 2981
Download times: 1573
Abstract:
      A conforming boundary recovery algorithm to solve the problem of arbitrary polyhedral tetrahedral mesh generation is presented, which can satisfy the boundary geometry and topology constraints. This method is based on boundary recovery algorithm of 3D Delaunay Tetrahedralization. Firstly, a dynamic programming method is employed to suppress the Steiner points on the boundary facets; and then the related tetrahedrons is repaired in order to maintain the integrity of the original polyhedron boundary topology; finally, an extended Laplacian smoothing method is utilized to improve the elements with poor quality. This algorithm can guarantee a complete recovery of arbitrary polyhedral boundary in theory. Moreover, it has a robust performance in practice.