|
| Boundary restore algorithm and sliver elimination of 3D constrained delaunay triangulation |
| Revised:July 12, 2002 |
| View Full Text View/Add Comment Download reader |
| DOI：10.7511/jslx20042032 |
| KeyWord:mesh generation,constrained delaunay triangulation,3D solid,boundary restore,sliver element |
| Song Chao,Guan Zhenqun~*,Gu Yuanxian uipment Dept. of Engineering Mechanics,Dalian University of Technology,Dalian 116024,China) |
|
| Hits: 1847 |
| Download times: 9 |
| Abstract: |
| An effective algorithm is proposed in this paper to restore the solid boundary for 3D constrained Delaunay triangulation in finite element mesh generation. The algorithm combines the advantages of methods given by P.L. George and N.P. Weatherill. By restoring constraint segments and triangular facet seperatively, the integrity of solid boundary after mesh could be maintained. So the constrained Delaunay triangulation method can be applied to generate mesh on any complex convex and concave 3D solids. In order to tackle the sliver element problem commonly existing in 3D Delaunay triangulation, a method called sliver decomposition is proposed. By decomposing sliver elements and their adjacent tetrahedral elements, all sliver elements under specified quality factor can be removed. The two algorithms are proved to be robust, efficient and easy to be implemented in practical appplications. |
|
|
|