Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Shape reconstruction from planar cross sections
Computer Vision, Graphics, and Image Processing
Introduction to algorithms
A triangulation algorithm from arbitrary shaped multiple planar contours
ACM Transactions on Graphics (TOG)
The homotopy model: a generalized model for smooth surface generation from cross sectional data
The Visual Computer: International Journal of Computer Graphics - Special issue on computer graphics international '89(CGI'89)
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
ACM Transactions on Graphics (TOG)
Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
Piecewise-linear interpolation between polygonal slices
Computer Vision and Image Understanding
Arbitrary topology shape reconstruction from planar cross sections
Graphical Models and Image Processing
Proceedings of the 1998 IEEE symposium on Volume visualization
VolVis98 1998 IEEE Volume Visualization Symposium
Improved constructions of Delaunay based contour surfaces
Proceedings of the fifth ACM symposium on Solid modeling and applications
Deformable Models in Medical Image Analysis
Deformable Models in Medical Image Analysis
Conversion of complex contour line definitions into polygonal element mosaics
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Constructing smooth branching surfaces from cross sections
Proceedings of the 2006 ACM symposium on Solid and physical modeling
G1-smooth branching surface construction from cross sections
Computer-Aided Design
International Journal of Computer Vision
| Hi-index | 0.00 |
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.