Tetrahedral mesh generation by Delaunay refinement
Proceedings of the fourteenth annual symposium on Computational geometry
On the Radius-Edge Condition in the Control Volume Method
SIAM Journal on Numerical Analysis
Mesh generation for domains with small angles
Proceedings of the sixteenth annual symposium on Computational geometry
A point-placement strategy for conforming Delaunay tetrahedralization
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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
Conforming Delaunay triangulations in 3D
Proceedings of the eighteenth annual symposium on Computational geometry
Quality meshing with weighted Delaunay refinement
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Quality meshing for polyhedra with small angles
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Variational tetrahedral meshing
ACM SIGGRAPH 2005 Papers
On the sizes of Delaunay meshes
Computational Geometry: Theory and Applications
Variational tetrahedral meshing
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
A generic software design for Delaunay refinement meshing
Computational Geometry: Theory and Applications
Delaunay refinement for piecewise smooth complexes
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating polyhedral objects with deformable smooth surfaces
Computational Geometry: Theory and Applications
Validation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization
GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
On the sizes of Delaunay meshes
Computational Geometry: Theory and Applications
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Feature-sensitive tetrahedral mesh generation with guaranteed quality
Computer-Aided Design
Size competitive meshing without large angles
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
We propose an algorithm to compute a conforming Delaunay mesh of a polyhedral domain. Arbitrarily small input angles are allowed. The output mesh is graded and has bounded radius-edge ratio everywhere.