Survey of curve and surface reconstruction algorithms from a set of unorganized points

Abstract

Reconstruction of curves and surfaces from a set of unorganized points is a problem with a lot of practical relevance and thus has been an active area of research. In the review various curve and surface reconstruction algorithms which take an unorganized set of points have been discussed. Also it highlights the major advantages and disadvantages of these algorithms. Delaunay triangulations are most important structures used in surface reconstruction algorithms as they work without the geometric properties of the points. Most of the curve and surface reconstruction algorithms combine different approaches with Delaunay Triangulations in order to make reconstruction more systematic and robust. All such types of major issues pertaining to surface reconstruction have been reviewed and mentioned.