19 July 2013 Robust Delaunay triangulation for domain with acute angles
Author Affiliations +
Proceedings Volume 8878, Fifth International Conference on Digital Image Processing (ICDIP 2013); 88783D (2013) https://doi.org/10.1117/12.2031767
Event: Fifth International Conference on Digital Image Processing, 2013, Beijing, 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. A simple terminator proof and some results are also presented.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xianhai Meng, Xianhai Meng, Guoyi Mei, Guoyi Mei, } "Robust Delaunay triangulation for domain with acute angles", Proc. SPIE 8878, Fifth International Conference on Digital Image Processing (ICDIP 2013), 88783D (19 July 2013); doi: 10.1117/12.2031767; https://doi.org/10.1117/12.2031767
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT

Panoramic stereo sphere vision
Proceedings of SPIE (February 04 2013)
Affine-invariant tetrahedrization
Proceedings of SPIE (September 30 1996)

Back to Top