Surface reconstruction and representation of 3-D scenes
Pattern Recognition
A syntactic/semantic technique for surface reconstruction from cross-sectional contours
Computer Vision, Graphics, and Image Processing
A framework for surface reconstruction from 3D contours
Computer Vision, Graphics, and Image Processing
Shape reconstruction from planar cross sections
Computer Vision, Graphics, and Image Processing
Pessimal Guesses may be Optimal: A Counterintuitive Search Result
IEEE Transactions on Pattern Analysis and Machine Intelligence
A triangulation algorithm from arbitrary shaped multiple planar contours
ACM Transactions on Graphics (TOG)
ACM Transactions on Graphics (TOG)
Surface reconstruction between simple polygons via angle criteria
Journal of Symbolic Computation - Special issue on “algorithms: implementation, libraries and use”
Piecewise-linear interpolation between polygonal slices
Computer Vision and Image Understanding
Arbitrary topology shape reconstruction from planar cross sections
Graphical Models and Image Processing
Multiresolution banded refinement to accelerate surface reconstruction from polygons
Proceedings of the fourteenth annual symposium on Computational geometry
Interactive multi-resolution modeling on arbitrary meshes
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Improved constructions of Delaunay based contour surfaces
Proceedings of the fifth ACM symposium on Solid modeling and applications
Optimal surface reconstruction from planar contours
Communications of the ACM
Surface Reconstruction by Multiaxial Triangulation
IEEE Computer Graphics and Applications
Straight Skeletons for General Polygonal Figures in the Plane
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
A new general triangulation method for planar contours
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
Conversion of complex contour line definitions into polygonal element mosaics
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Surface definition for branching, contour-defined objects
ACM SIGGRAPH Computer Graphics
3D Object Reconstruction from Non-Parallel Cross-Sections
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03
Contour interpolation by straight skeletons
Graphical Models
Shape reconstruction from unorganized cross-sections
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Approximating complex surfaces by triangulation of contour lines
IBM Journal of Research and Development
Geometric tomography with topological guarantees
Proceedings of the twenty-sixth annual symposium on Computational geometry
Topologically correct reconstruction of tortuous contour forests
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Online reconstruction of 3D objects from arbitrary cross-sections
ACM Transactions on Graphics (TOG)
Topologically correct reconstruction of tortuous contour forests
Computer-Aided Design
Hi-index | 0.00 |
We present a novel algorithm for reconstructing a subdivision of the three-dimensional space (given arbitrarily-oriented slices of it) into labeled domains. The input to the algorithm is a collection of nonparallel planar cross-sections of an unknown object, where the sections might cover only portions of the supporting planes. (The information in the rest of these planes is, thus, "unknown.") Each cross-section consists of a partition of the plane into closed labeled ("colored") domains with no restrictions whatsoever on either their geometries or topologies, and without any assumptions about similarities between partitions of different sections. The problem is to reconstruct the original three-dimensional partition by interpolating simultaneously all the cross-sections, so that planar domains in the input are connected only to other domains of the same color, no two reconstructed spatial domains intersect, and no unnecessary gaps remain between the reconstructed colored domains. The problem of reconstructing multiple-labeled domains arises, for example, in medical imaging, where different types of tissues are scanned and reconstructed at the same time. Partial slices are typical, for example, in ultrasound scanning. In this work we use the three-dimensional straight-skeleton of the arrangement of the cross-sections. Since the sections might be partial, cells of the arrangement might be nonconvex. For this we use the unambiguous definition, as well as the implementation of the computation, of the straight skeleton of a three-dimensional polyhedron that we presented in a recent work [BEGV08]. First, we define these cells and compute their skeleton. Second, we compute overlays of portions of sampled contours in the cross-sections, using the cell skeletons to guide the reconstruction of the mesh.