Optimization of Mesh Reconstruction using Delaunay and Ball Pivoting Algorithm
It is very important to approximate a shape from the coordinates of a given set of points for surface reconstruction. The specific shape deals with curves in two dimensions and surfaces in three dimensions. In this paper we have presented a hybrid model of the ball pivoting and Delaunay algorithm for mesh reconstruction from 3D point cloud. The ball of a diameter d pivots around an edge keeping in contact with the edge's endpoints until it touches another point, forming another triangle and the diameter of the ball is increased according to the requirement, when the pivoting ball is not able to reach to some of the sample points, then the pivoting ball is rotated in 3D. This improvement will lead to more effective representation of 3D image. The hybrid model of Ball Pivoting and Delaunay Algorithm is efficient in terms of execution time and storage requirements, number of triangles created, and time spend for computing triangles.