SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Smoothing and cleaning up slivers
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Sink-insertion for mesh improvement
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Quality meshing with weighted Delaunay refinement
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Provably good surface sampling and approximation
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
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
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Mesh deformation of dynamic smooth manifolds with surface correspondences
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Adaptive skin meshes coarsening for biomolecular simulation
Computer Aided Geometric Design
| Hi-index | 0.00 |
This paper presents an algorithm to generate quality tetrahedral meshes for the volumes bounded by the molecular skin model defined by Edelsbrunner. The algorithm applies the Delaunay refinement to the tetrahedral meshes bounded by quality surface meshes. In particular, we iteratively insert the circumcenters of bad shape tetrahedra with a priority parameterized by its distance from the surface. We achieve a bounded radius-edge ratio for the tetrahedral mesh after the refinement. Finally, we apply the sliver exudation algorithm to remove ‘slivers'. The algorithm terminates with guarantees on the tetrahedral quality and an accurate approximation of the original surface boundary.