Surface Reconstruction of 3D Objects

A priority driven based algorithm for surface reconstruction from a set of surface points is presented. It calculates the shape change at the boundary of mesh area and builds a priority queue for the advance front of mesh area according to the changes. Then, the mesh growing process is forced to propagate in reliable direction through the queue. The algorithm reconstructs surface in a fast and reliable way. The efficiency of the proposed algorithm is demonstrated by the experimental results.

[1]  Gabriel Taubin,et al.  The ball-pivoting algorithm for surface reconstruction , 1999, IEEE Transactions on Visualization and Computer Graphics.

[2]  Marc Levoy,et al.  Zippered polygon meshes from range images , 1994, SIGGRAPH.

[3]  Jon Louis Bentley,et al.  An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[4]  Ronald Fedkiw,et al.  Level set methods and dynamic implicit surfaces , 2002, Applied mathematical sciences.

[5]  Thomas S. Huang,et al.  Image processing , 1971 .

[6]  Sunghee Choi,et al.  A Simple Algorithm for Homeomorphic Surface Reconstruction , 2002, Int. J. Comput. Geom. Appl..