Alignment of 3-D scanning data for polygonal mesh based on modified triangulation

Alignment of 3-D scanning data is important in holography, gesture based gaming, statuette modelling, tomography and so on. All of this sector are advancing day by day on the basis of computational geometry. One of the most complex open problems in the sector of combinatorial and computational geometry is to deal with convex hull. This type of problem commonly arises in the several cases like meshing, 3D data alignment etc. For generating 3D model first, we have to compute the triangulation step. In this study, a divide and conquer based way of triangulation is presented. Furthermore, detecting the point of interest in the vornoi region as well as discarding of other points is also an important feature of the study. The outcome of the study shows effective reconstruction with legit triangulation, less computation time for determining convex hull and a smoothed polygon through proper edge flipping.