3D reconstruction from sparse unorganized cross sections

Abstract

In this thesis work, we propose an algorithm for smooth 3D object reconstruction from un- organized planar cross sections. We address the problem in its full generality, and show its e ectiveness on sparse set of cutting planes. Our algorithm is based on construction of a glob- ally consistent signed distance function over the cutting planes. It uses a divide-and-conquer approach utilizing Hermite mean-value interpolation for triangular meshes. This work improvises on recent approaches by providing a simpli ed construction that avoids need for post-processing to smoothen the reconstructed object boundary. We provide results of reconstruction and its comparison with other algorithms.