Delaunay mesh generation governed by metric specifications. Part I algorithms
Finite Elements in Analysis and Design
Delaunay mesh generation governed by metric specifications. Part II. applications
Finite Elements in Analysis and Design
Tetrahedral mesh generation by Delaunay refinement
Proceedings of the fourteenth annual symposium on Computational geometry
Journal of the ACM (JACM)
Conforming Delaunay triangulations in 3D
Proceedings of the eighteenth annual symposium on Computational geometry
Dual contouring of hermite data
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Sliver-free three dimensional delaunay mesh generation
Sliver-free three dimensional delaunay mesh generation
Variational tetrahedral meshing
ACM SIGGRAPH 2005 Papers
Isosurface stuffing: fast tetrahedral meshes with good dihedral angles
ACM SIGGRAPH 2007 papers
High-fidelity geometric modeling for biomedical applications
Finite Elements in Analysis and Design
Variational tetrahedral mesh generation from discrete volume data
The Visual Computer: International Journal of Computer Graphics
Journal of Biomedical Imaging
New software developments for quality mesh generation and optimization from biomedical imaging data
Computer Methods and Programs in Biomedicine
| Hi-index | 0.00 |
Tetrahedral meshes are being extensively used in finite element methods (FEMs). This paper proposes an algorithm to generate feature-sensitive and high-quality tetrahedral meshes from an arbitrary surface mesh model. A top-down octree subdivision is conducted on the surface mesh and a set of tetrahedra are constructed using adaptive body-centered cubic (BCC) lattices. Special treatments are given to the tetrahedra near the surface such that the quality of the resulting tetrahedral mesh is provably guaranteed: the smallest dihedral angle is always greater than 5.71^o. The meshes generated by our method are not only adaptive from the interior to the boundary, but also feature-sensitive on the surface with denser elements in high-curvature regions where geometric features most likely reside. A variety of experimental results are presented to demonstrate the effectiveness and robustness of this algorithm.