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)
Surface reconstruction between simple polygons via angle criteria
Journal of Symbolic Computation - Special issue on “algorithms: implementation, libraries and use”
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Piecewise-linear interpolation between polygonal slices
Computer Vision and Image Understanding
Arbitrary topology shape reconstruction from planar cross sections
Graphical Models and Image Processing
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Multiresolution banded refinement to accelerate surface reconstruction from polygons
Proceedings of the fourteenth annual symposium on Computational geometry
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
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
Motorcycle graphs and straight skeletons
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Straight-skeleton based contour interpolation
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Surface definition for branching, contour-defined objects
ACM SIGGRAPH Computer Graphics
Nonlinear interpolation between slices
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Shape reconstruction from unorganized cross-sections
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Straight Skeletons of Three-Dimensional Polyhedra
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Straight skeletons of three-dimensional polyhedra
Proceedings of the twenty-fifth annual symposium on Computational geometry
Surface reconstruction by moving contours
CGIM '07 Proceedings of the Ninth IASTED International Conference on Computer Graphics and Imaging
Reconstruction of multi-label domains from partial planar cross-sections
SGP '09 Proceedings of the Symposium on Geometry Processing
Technical Section: Shape approximation by differential properties of scalar functions
Computers and Graphics
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)
On the structure of straight skeletons
Transactions on Computational Science VI
Shape reconstruction from unorganized set of points
ICIAR'10 Proceedings of the 7th international conference on Image Analysis and Recognition - Volume Part I
Topologically correct reconstruction of tortuous contour forests
Computer-Aided Design
Hi-index | 0.00 |
In this paper we present an efficient method for interpolating a piecewise-linear surface between two parallel slices, each consisting of an arbitrary number of (possibly nested) polygons that define 'material' and 'non-material' regions. This problem has applications to medical imaging, geographic information systems, etc. Our method is fully automatic and is guaranteed to produce non-self-intersecting surfaces in all cases regardless of the number of contours in each slice, their complexity and geometry, and the depth of their hierarchy of nesting. The method is based on computing cells in the overlay of the slices that form the symmetric difference between them. Then, the straight skeletons of the selected cells guide the triangulation of each face of the skeletons. Finally, the resulting triangles are lifted up in space to form an interpolating surface. We provide some experimental results on various complex examples to show the good and robust performance of our algorithm.