Surface recovery from planar sectional contours

We propose an approach for surface recovery from planar sectional contours. The surface is reconstructed based on the so-called "equal importance criterion" which suggests that every point in the region contributes equally to the reconstruction process. The problem is then formulated in terms of a partial differential equation, and the solution is efficiently calculated from a distance transformation. To make the algorithm valid for different application purposes, both the isosurface and the primitive representations of the object surface are derived. The isosurface is constructed by a partial differential equation, which can be solved iteratively. The traditional distance interpolating method, which was used by several researchers for surface reconstruction, is an approximate solution of the PDE. The primitive representations are approximated by Voronoi diagram transformation of the surface space. Isosurfaces have the advantage that subsequent geometric analysis of the object can be easily carried out while primitive representation is easy to visualize. The proposed technique allows for surface recovery at any desired resolution, thus avoiding the inherent problems of correspondence, tiling, and branching.

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

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

[3]  Kazufumi Kaneda,et al.  Shape-based calculation and visualisation of general cross-sections through biological data , 1997, Proceedings. 1997 IEEE Conference on Information Visualization (Cat. No.97TB100165).

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

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

[6]  T. Todd Elvins,et al.  A survey of algorithms for volume visualization , 1992, COMG.

[7]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

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

[9]  Edward J. Coyle,et al.  Arbitrary Topology Shape Reconstruction from Planar Cross Sections , 1996, CVGIP Graph. Model. Image Process..

[10]  D. T. Lee,et al.  Generalization of Voronoi Diagrams in the Plane , 1981, SIAM J. Comput..

[11]  Milan Sonka,et al.  Image Processing, Analysis and Machine Vision , 1993, Springer US.

[12]  Bahram Parvin,et al.  An Algebraic Solution to Surface Recovery from Cross-Sectional Contours , 1999, Graph. Model. Image Process..

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

[14]  Robert M. O'Bara,et al.  Geometrically deformed models: a method for extracting closed geometric models form volume data , 1991, SIGGRAPH.

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

[16]  Jean-Daniel Boissonnat,et al.  Three-dimensional reconstruction of complex shapes based on the Delaunay triangulation , 1993, Electronic Imaging.

[17]  Lawrence C. Evans Estimates for smooth absolutely minimizing Lipschitz extensions. , 1993 .

[18]  Nicholas Ayache,et al.  From voxel to intrinsic surface features , 1992, Image Vis. Comput..

[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]  David Levin Multidimensional Reconstruction by Set-valued Approximations , 1986 .

[21]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[22]  Chin-Tu Chen,et al.  A new surface interpolation technique for reconstructing 3D objects from serial cross-sections , 1989, Comput. Vis. Graph. Image Process..

[23]  Min Chen,et al.  A New Approach to the Construction of Surfaces from Contour Data , 1994, Comput. Graph. Forum.

[24]  G. Aronsson Extension of functions satisfying lipschitz conditions , 1967 .

[25]  Wei Xing Wang,et al.  Binary Image Segmentation Of Aggregates Based On Polygonal Approximation And Classification Of Concavities , 1998, Pattern Recognit..

[26]  Rafael C. González,et al.  Local Determination of a Moving Contrast Edge , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[27]  Olivier D. Faugeras,et al.  From partial derivatives of 3-D density images to ridge lines , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

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

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

[30]  Sabine Coquillart,et al.  3D Reconstruction of Complex Polyhedral Shapes from Contours using a Simplified Generalized Voronoi Diagram , 1996, Comput. Graph. Forum.

[31]  Henry Fuchs,et al.  Optimal surface reconstruction from planar contours , 1977, CACM.

[32]  Benjamin B. Kimia,et al.  On the evolution of curves via a function of curvature , 1992 .

[33]  G. Borgefors Distance transformations in arbitrary dimensions , 1984 .

[34]  Gunnar Aronsson,et al.  On certain singular solutions of the partial differential equation ux2uxx+2uxuyuxy+uy2uyy=0 , 1984 .