2011•Journal of Xi'an Technological UniversityRequires access
Improved Delaunay Triangulation Algorithm
Gang Cheng
Open publisher page 0 citations
Abstract
Traditional Delaunay triangulation algorithm is incapable in obtaining ideal partition results for non-convex data set.To solve this problem.An improved Delaunay triangulation algorithm based on convex partition is proposed.The theorem of convex partition for non-convex set is proposed,and convex partition of complex surface on the basis of projection plane is deduced.According to the theorems,the orthogonal plane based Delaunay triangulation can be performed on the complex surface.The experiments performed on head 3D data show that the improved Delaunay triangulation on projection plane is corrected and the robustness is enhanced,which conforms with the theoretical analysis,thus the correctness and effectiveness are testified.