Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
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
Delaunay refinement mesh generation
Delaunay refinement mesh generation
A time efficient Delaunay refinement algorithm
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A time-optimal delaunay refinement algorithm in two dimensions
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Geometry and Topology for Mesh Generation (Cambridge Monographs on Applied and Computational Mathematics)
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
Topological inference via meshing
Proceedings of the twenty-sixth annual symposium on Computational geometry
Efficient and good Delaunay meshes from random points
Computer-Aided Design
A review on delaunay refinement techniques
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
| Hi-index | 0.00 |
We introduce a new type of Steiner points, called off-centers, as an alternative to circumcenters, to improve the quality of Delaunay triangulations in two dimensions. We propose a new Delaunay refinement algorithm based on iterative insertion of off-centers. We show that this new algorithm has the same quality and size optimality guarantees of the best known refinement algorithms. In practice, however, the new algorithm inserts fewer Steiner points, runs faster, and generates smaller triangulations than the best previous algorithms. Performance improvements are significant especially when user-specified minimum angle is large, e.g., when the smallest angle in the output triangulation is 30^o, the number of Steiner points is reduced by about 40%, while the mesh size is down by about 30%. As a result of its shown benefits, the algorithm described here has already replaced the well-known circumcenter insertion algorithm of Ruppert and has been the default quality triangulation method in the popular meshing software Triangle.