Arbitrary Topology Shape Reconstruction from Planar Cross Sections

In computed tomography, magnetic resonance imaging and ultrasound imaging, reconstruction of the 3D object from the 2D scalar-valued slices obtained by the imaging system is difficult because of the large spacings between the 2D slices. The aliasing that results from this undersampling in the direction orthogonal to the slices leads to two problems, known as the correspondence problem and the tiling problem. A third problem, known as the branching problem, arises because of the structure of the objects being imaged in these applications. Existing reconstruction algorithms typically address only one or two of these problems. In this paper, we approach all three of these problems simultaneously. This is accomplished by imposing a set of three constraints on the reconstructed surface and then deriving precise correspondence and tiling rules from these constraints. The constraints ensure that the regions tiled by these rules obey physical constructs and have a natural appearance. Regions which cannot be tiled by these rules without breaking one or more constraints are tiled with their medial axis (edge Voronoi diagram). Our implementation of the above approach generates triangles of 3D isosurfaces from input which is either a set of contour data or a volume of image slices. Results obtained with synthetic and actual medical data are presented. There are still specific cases in which our new approach can generate distorted results, but these cases are much less likely to occur than those which cause distortions in other tiling approaches.

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

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

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

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

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

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

[7]  Nasser Kehtarnavaz,et al.  A syntactic/Semantic technique for surface reconstruction from cross-sectional contours , 1988, Comput. Vis. Graph. Image Process..

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

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

[10]  Kenneth L. Clarkson,et al.  A Randomized Algorithm for Closest-Point Queries , 1988, SIAM J. Comput..

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

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

[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]  Nasser Kehtarnavaz,et al.  A framework for surface reconstruction from 3D contours , 1988, Comput. Vis. Graph. Image Process..

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

[17]  Micha Sharir,et al.  Piecewise-linear interpolation between polygonal slices , 1994, SCG '94.

[18]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[19]  Michael Shantz,et al.  Surface definition for branching, contour-defined objects , 1981, COMG.

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

[21]  Godfried T. Toussaint,et al.  On Approximating Polygonal Curves in Two and Three Dimensions , 1994, CVGIP Graph. Model. Image Process..

[22]  Jonathan Ophir,et al.  An Algorithm for Volume Estimation Based on Polyhedral Approxi mation , 1980, IEEE Transactions on Biomedical Engineering.

[23]  David Meyers Reconstruction of surfaces from planar contours , 1995 .

[24]  Joseph O'Rourke On the Scaling Heuristic for Reconstruction from Slices , 1994, CVGIP Graph. Model. Image Process..

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

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

[27]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

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

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

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

[31]  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..