Guaranteed-quality mesh generation for curved surfaces
SCG '93 Proceedings of the ninth 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
A Delaunay based numerical method for three dimensions: generation, formulation, and partition
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
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
Geometric Separators for Finite-Element Meshes
SIAM Journal on Scientific Computing
Optimal point placement for mesh smoothing
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
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
Geometry and topology for mesh generation
Geometry and topology for mesh generation
Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Perturbations and vertex removal in a 3D delaunay triangulation
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Adaptive and quality 3D meshing from imaging data
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
Variational tetrahedral meshing
ACM SIGGRAPH 2005 Papers
Variational tetrahedral meshing
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Isosurface stuffing: fast tetrahedral meshes with good dihedral angles
ACM SIGGRAPH 2007 papers
Quality mesh generation for molecular skin surfaces using restricted union of balls
Computational Geometry: Theory and Applications
Quality tetrahedral mesh generation for macromolecules
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| 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 silvers 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 silvers. This success is achieved by combining the weight pumping method for sliver exudation and the Delaunay refinement method for boundary conformation. We show that an incremental weight pumping can be mixed seamlessly with vertex insertions in our weighted Delaunay refinement paradigm.