Tetrahedral mesh generation by Delaunay refinement
Proceedings of the fourteenth annual symposium on Computational geometry
On the definition and the construction of pockets in macromolecules
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
A new and simple algorithm for quality 2-dimensional mesh generation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Sink-insertion for mesh improvement
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Sliver-free three dimensional delaunay mesh generation
Sliver-free three dimensional delaunay mesh generation
| Hi-index | 0.00 |
Generating high quality meshes is one of the most important steps in many applications such as scientific computing. Sink insertion method is one of the mesh quality improvement methods that had been proposed recently. However, it is unknown whether this method is competitive to generate meshes with small number of elements. In this paper, we show that, given a two-dimensional polygonal domain with no small angles, the sink insertion method generates a well-shaped mesh with O(n) triangles, where n is the minimum number of triangles generated by any method with the same quality guarantee. We also show that the sink insertion method more likely can not guarantee the same result for a three-dimensional domain, while the other methods such as Delaunay refinement can achieve.