Reconstruction of surfaces from planar contours

This dissertation is concerned with the problem of reconstructing the surfaces of three-dimensional objects from a collection of planar contours representing cross sections through the objects. This problem has important applications in diverse fields, including bio-medical research and instruction, solid modeling, geology, archaeology, oceanography and industrial inspection. The problem can be broken into four subproblems, the correspondence problem, the tiling problem, the branching problem, and the surface fitting problem. This dissertation is concerned with improving the quality of automated solutions to the tiling and branching problems. A new method for solving the tiling problem is developed that makes use of multiresolution analysis to improve performance of an optimizing tiling algorithm both in terms of execution time and space requirement. The method computes an optimized tiling at low resolution, then adds detail to the low resolution tiling by alternating between adding wavelet coefficients and local optimization until the original resolution has been reached. By halting the reconstruction before reaching the original resolution, the method also provides an efficient and effective way to reduce the number of vertices used to represent a contour, with savings in the time required to display a reconstruction and in the space required to store it, all with minimum loss of detail. A new method for solving the branching problem is also developed. It makes use of the medial axis transformation to classify branches into one of three types. The strategy used for constructing a solution to the branching problem is different for each of the classes. Depending on branch class, post-branch contours are merged to form composite contours or pre-branch contours are split into sub-contours, establishing a one-to-one correspondence of contours between sections, so that a standard tiling algorithm can be used. The new method considers the shapes of the pre-branch and post-branch contours when modification are made. Previous methods generally have not considered contour shape when forming composites, and the results have often been of poor quality. The new method is a significant improvement over previously available methods.

[1]  Eric Keppel,et al.  Approximating Complex Surfaces by Triangulation of Contour Lines , 1975, IBM J. Res. Dev..

[2]  Henry Fuchs,et al.  Optimal surface reconstruction from planar contours , 1977, SIGGRAPH.

[3]  Peter R. Atherton,et al.  Hidden surface removal using polygon area sorting , 1977, SIGGRAPH.

[4]  Thomas W. Sederberg,et al.  Conversion of complex contour line definitions into polygonal element mosaics , 1978, SIGGRAPH.

[5]  B. Soroka Understanding objects from slices: extracting generalised cylinder descriptions from serial sections. , 1979 .

[6]  Kevin Weiler Polygon comparison using a graph representation , 1980, SIGGRAPH '80.

[7]  Barry I. Soroka,et al.  Generalized cones from serial sections , 1981 .

[8]  D. T. Lee,et al.  Medial Axis Transformation of a Planar Shape , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  S. Ganapathy,et al.  A new general triangulation method for planar contours , 1982, SIGGRAPH.

[10]  Larry Cook,et al.  A Three-Dimensional Display System for Diagnostic Imaging Applications , 1983, IEEE Computer Graphics and Applications.

[11]  J. K. Aggarwal,et al.  CONSTRUCTION OF SURFACE REPRESENTATION FROM 3-D VOLUMETRIC SCENE DESCRIPTION. , 1985 .

[12]  Yuan-Fang Wang,et al.  Surface reconstruction and representation of 3-D scenes , 1986, Pattern Recognit..

[13]  Kenneth R. Sloan,et al.  From contours to surfaces: testbed and initial results , 1986, CHI '87.

[14]  Vijay Srinivasan,et al.  Voronoi Diagram for Multiply-Connected Polygonal Domains I: Algorithm , 1987, IBM J. Res. Dev..

[15]  Michael Zyda,et al.  Surface construction from planar contours , 1987, Comput. Graph..

[16]  Fujio Yamaguchi,et al.  Curves and Surfaces in Computer Aided Geometric Design , 1988, Springer Berlin Heidelberg.

[17]  Jean-Daniel Boissonnat,et al.  Shape reconstruction from planar cross sections , 1988, Comput. Vis. Graph. Image Process..

[18]  Kenneth R. Sloan,et al.  Pessimal Guesses may be Optimal: A Counterintuitive Search Result , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Jeffrey A. Fessler,et al.  A Bayesian Approach to Reconstruction from Incomplete Projections of a Multiple Object 3D Domain , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Stéphane Mallat,et al.  A Theory for Multiresolution Signal Decomposition: The Wavelet Representation , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  Tosiyasu L. Kunii,et al.  Surface coding based on Morse theory , 1991, IEEE Computer Graphics and Applications.

[22]  Tosiyasu L. Kunii,et al.  Constructing a Reeb graph automatically from cross sections , 1991, IEEE Computer Graphics and Applications.

[23]  A. B. Ekoule,et al.  A triangulation algorithm from arbitrary shaped multiple planar contours , 1991, TOGS.

[24]  Helmut Alt,et al.  Measuring the resemblance of polygonal curves , 1992, SCG '92.

[25]  Kenneth R. Sloan,et al.  Surfaces from contours , 1992, TOGS.

[26]  Tony DeRose,et al.  8. A Survey of Parametric Scattered Data Fitting Using Triangular Interpolants , 1992, Curve and Surface Design.

[27]  Tony DeRose,et al.  Efficient, fair interpolation using Catmull-Clark surfaces , 1993, SIGGRAPH.

[28]  B. Geiger Three-dimensional modeling of human organs and its application to diagnosis and surgical planning , 1993 .

[29]  David Meyers,et al.  Multiresolution Tiling , 1994, Comput. Graph. Forum.

[30]  Amara Lynn Graps,et al.  An introduction to wavelets , 1995 .

[31]  William E. Lorensen,et al.  Marching cubes: a high resolution 3D surface construction algorithm , 1996 .

[32]  Joseph O'Rourke,et al.  On reconstructing polyhedra from parallel slices , 1996, Int. J. Comput. Geom. Appl..

[33]  Tony DeRose,et al.  Multiresolution analysis for surfaces of arbitrary topological type , 1997, TOGS.