Beta-connection: Generating a family of models from planar cross sections

Despite the significant evolution of techniques for 3D-reconstruction from planar cross sections, establishing the correspondence of regions in adjacent slices remains an important issue. In this article, we propose a novel approach for solving the correspondence problem in a flexible manner. We show that from the 3D Delaunay triangulation, it is possible to derive a distance measure among regions lying in adjacent slices. Such distance is used to define a positive integer parameter, called β, responsible for establishing the connections. Varying β thus allows the construction of different models from a given set of cross-sectional regions: small values of β causes closer regions to be connected into a single component, and as β increases, more distant regions are connected together. The algorithm, named β-connection, is described, and examples are provided that illustrate its applicability in solid modeling and model reconstruction from real data. The underlying reconstruction method is effective, which jointly with the β-connection correspondence strategy, improve the usability of volumetric reconstruction techniques considerably.

[1]  John Hart,et al.  ACM Transactions on Graphics , 2004, SIGGRAPH 2004.

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

[3]  Akshay K. Singh,et al.  Deformable models in medical image analysis , 1996, Proceedings of the Workshop on Mathematical Methods in Biomedical Image Analysis.

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

[5]  Herbert Edelsbrunner,et al.  Three-dimensional alpha shapes , 1992, VVS.

[6]  William E. Lorensen,et al.  The visualization toolkit (2nd ed.): an object-oriented approach to 3D graphics , 1998 .

[7]  Herbert Edelsbrunner,et al.  Three-dimensional alpha shapes , 1994, ACM Trans. Graph..

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

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

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

[11]  Edward J. Coyle,et al.  Tetrahedral meshes from planar cross-sections , 1999 .

[12]  Rosane Minghim,et al.  A Novel Approach for Delaunay 3D Reconstruction with a Comparative Analysis in the Light of Applications , 2001, Comput. Graph. Forum.

[13]  Tamal K. Dey,et al.  Improved constructions of Delaunay based contour surfaces , 1999, SMA '99.

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

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

[16]  Tosiyasu L. Kunii,et al.  The homotopy model: a generalized model for smooth surface generation from cross sectional data , 1991, The Visual Computer.

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

[18]  Steven Fortune,et al.  Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[19]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

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

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

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

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

[24]  William Schroeder,et al.  The Visualization Toolkit: An Object-Oriented Approach to 3-D Graphics , 1997 .