Meng Xianhai
School of Computer Science and Engineering, Beihang University, Beijing 100191, China
ABSTRACT
A new algorithm is presented to automatic generate conforming Delaunay triangulation of non-manifold geometric domains with acute angles. The algorithm is based on Delaunay refinement technique, which often failed to terminate when there are small angles in input geometry. By assigning proper weights to vertices on sharp-angled elements and take place Delaunay triangulation with weighted Delaunay triangulation, the algorithm can accept any inputs without any bound on angle and without setting any protected area and adding any new vertices near the sharp-angled elements. The algorithm also guarantees bounded circumradius to shortest edge length for all elements except the ones near small input angles. Some results are also presented.
PDF References Citation
How to cite this article
Meng Xianhai, 2013. Conforming Delaunay Triangulation for Domain with Small Angles. Information Technology Journal, 12: 4046-4051.
DOI: 10.3923/itj.2013.4046.4051
URL: https://scialert.net/abstract/?doi=itj.2013.4046.4051
DOI: 10.3923/itj.2013.4046.4051
URL: https://scialert.net/abstract/?doi=itj.2013.4046.4051
REFERENCES
- Cohen-Steiner, D., E.C. De Verdiere and M. Yvinec, 2002. Conforming Delaunay triangulations in 3D. Proceedings of the 18th Annual Symposium on Computational Geometry, June 5-7, 2002, Barcelona, Spain, pp: 199-208.
CrossRef - Ruppert, J., 1995. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms, 18: 548-585.
CrossRef - Shewchuk, J.R., 1998. Tetrahedral mesh generation by Delaunay refinement. Proceedings of the 14th Annual Symposium on Computational Geometry, June 7-10, 1998, Minneapolis, MN., USA., pp: 86-95.
CrossRef - Shewchuk, J.R., 2000. Mesh generation for domains with small angles. Proceedings of the 16th Annual Symposium on Computational Geometry, May 12-14, 2000, Hong Kong, pp: 1-10.
CrossRef - Shewchuk, J.R., 2002. Delaunay refinement algorithms for triangular mesh generation. Comput. Geometry, 22: 21-74.
CrossRef