|
Study on Delaunay triangulation algorithm for polygon with inside islets
Ma, Hong-Bin (1); Guo, Jia-Teng (1); He, Qun (1); Liu, Xin-Rui (1)
2009, 30 (5):
733-736.
DOI: -
A universal algorithm for Delaunay triangulation of any polygon with or without islets is presented. In this algorithm, the constrained Delaunay triangular irregular network (CD-TIN) including all the vertices of a polygon, i.e., the vertices of the polygon itself and vertices of all inside islets, is constructed, of which all the edges of the polygon are constrained, then the criterion for seeking triangles outside or inside the polygon is presented to identify or eliminate unwanted triangles from the CD-TIN so as to triangulate the polygon with inside islets. A testing triangulation experiment for a polygon with 100 inside islets was done with this algorithm, and the result showed that this algorithm is efficient and robust for triangulating complex polygons with large numbers of inside islets. This algorithm has been successfully applied to the three-dimensional ore-body modeling and visualization system, in which it is used to triangulate the sectional polygons with inside islets, e.g., the inside stones or holes in ore-body, and its high efficiency has been proved.
References |
Related Articles |
Metrics
|