Sampling and meshing a surface with guaranteed topology and geometry
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Quality meshing for polyhedra with small angles
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Sliver removal by lattice refinement
Proceedings of the twenty-second annual symposium on Computational geometry
On the sizes of Delaunay meshes
Computational Geometry: Theory and Applications
A generic software design for Delaunay refinement meshing
Computational Geometry: Theory and Applications
On the sizes of Delaunay meshes
Computational Geometry: Theory and Applications
Perturbations for Delaunay and weighted Delaunay 3D triangulations
Computational Geometry: Theory and Applications
New Bounds on the Size of Optimal Meshes
Computer Graphics Forum
Computing self-supporting surfaces by regular triangulation
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
| Hi-index | 0.00 |
Delaunay meshes with bounded circumradius to shortest edge length ratio have been proposed in the past for quality meshing. The only poor quality tetrahedra, called slivers, that can occur in such a mesh can be eliminated by the sliver exudation method. This method has been shown to work for periodic point sets, but not with boundaries. Recently a randomized point-placement strategy has been proposed to remove slivers while conforming to a given boundary. In this paper we present a deterministic algorithm for generating a weighted Delaunay mesh which respects the input boundary and has no poor quality tetrahedron including slivers. As in previous work, we assume that no input angle is acute. Our result is achieved by combining the weight pumping method for sliver exudation and the Delaunay refinement method for boundary conformation.