论文部分内容阅读
An improved algorithm of Delaunay triangulation is proposed by expanding the scope from a convex polygon to an arbitrary polygon area in which holes can be contained in the subdivision procedure. The data structure of generated triangles and the exuviatio