Implementing Watson's algorithm in three dimensions
SCG '86 Proceedings of the second annual symposium on Computational geometry
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
A Delaunay refinement algorithm for quality 2-dimensional mesh generation
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Guaranteed-quality Delaunay meshing in 3D (short version)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Tetrahedral mesh generation by Delaunay refinement
Proceedings of the fourteenth annual symposium on Computational geometry
Smoothing and cleaning up slivers
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quality Mesh Generation in Higher Dimensions
SIAM Journal on Computing
Journal of the ACM (JACM)
Generating well-shaped Delaunay meshed in 3D
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Finite Element Method for Elliptic Problems
Finite Element Method for Elliptic Problems
Quality Meshing with Weighted Delaunay Refinement
SIAM Journal on Computing
Interpolating and approximating implicit surfaces from polygon soup
ACM SIGGRAPH 2004 Papers
Sparse parallel Delaunay mesh refinement
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
A finite element method for animating large viscoplastic flow
ACM SIGGRAPH 2007 papers
Isosurface stuffing: fast tetrahedral meshes with good dihedral angles
ACM SIGGRAPH 2007 papers
High Quality Surface Mesh Generation for Multi-physics Bio-medical Simulations
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
| Hi-index | 0.00 |
I present an algorithm that can provably eliminate slivers in the interior of a tetrahedral mesh, leaving only tetrahedra with dihedral angles between 30 and 135 degrees and radius-edge ratios of at most 1.368, except near the boundary. In comparison, previous bounds on dihedral angles were microscopic. The final mesh can respect specified input vertices and a user-defined sizing function. The algorithm comes with a bound on the sizes of the features it creates, and can provably grade from small to large tetrahedra.