Share Email Print

Proceedings Paper

Robust Delaunay triangulation for domain with acute angles
Author(s): Xianhai Meng; Guoyi Mei
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 19 July 2013
PDF: 8 pages
Proc. SPIE 8878, Fifth International Conference on Digital Image Processing (ICDIP 2013), 88783D (19 July 2013); doi: 10.1117/12.2031767
Show Author Affiliations
Xianhai Meng, Beihang Univ. (China)
Guoyi Mei, Beihang Univ. (China)

Published in SPIE Proceedings Vol. 8878:
Fifth International Conference on Digital Image Processing (ICDIP 2013)
Yulin Wang; Xie Yi, Editor(s)

© SPIE. Terms of Use
Back to Top