Shape reconstruction from planar cross sections
Computer Vision, Graphics, and Image Processing
Filling gaps in the boundary of a polyhedron
Computer Aided Geometric Design
Piecewise-linear interpolation between polygonal slices
Computer Vision and Image Understanding
Arbitrary topology shape reconstruction from planar cross sections
Graphical Models and Image Processing
Implicit fairing of irregular meshes using diffusion and curvature flow
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Optimal surface reconstruction from planar contours
Communications of the ACM
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Loops in reeb graphs of 2-manifolds
Proceedings of the nineteenth annual symposium on Computational geometry
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
Global conformal surface parameterization
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Fair morse functions for extracting the topological structure of a surface mesh
ACM SIGGRAPH 2004 Papers
Variational shape approximation
ACM SIGGRAPH 2004 Papers
Feature-based surface parameterization and texture mapping
ACM Transactions on Graphics (TOG)
Geometry-Aware Bases for Shape Approximation
IEEE Transactions on Visualization and Computer Graphics
Contour interpolation by straight skeletons
Graphical Models
Persistence-sensitive simplification functions on 2-manifolds
Proceedings of the twenty-second annual symposium on Computational geometry
Spectral surface quadrangulation
ACM SIGGRAPH 2006 Papers
Periodic global parameterization
ACM Transactions on Graphics (TOG)
Robust on-line computation of Reeb graphs: simplicity and speed
ACM SIGGRAPH 2007 papers
Designing quadrangulations with discrete harmonic forms
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Shape reconstruction from unorganized cross-sections
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Enhancing 3D mesh topological skeletons with discrete contour constrictions
The Visual Computer: International Journal of Computer Graphics
Reeb graphs for shape analysis and applications
Theoretical Computer Science
Describing shapes by geometrical-topological properties of real functions
ACM Computing Surveys (CSUR)
Spectral quadrangulation with orientation and alignment control
ACM SIGGRAPH Asia 2008 papers
ACM SIGGRAPH 2009 papers
A Minimal Contouring Approach to the Computation of the Reeb Graph
IEEE Transactions on Visualization and Computer Graphics
Technical Section: Computing smooth approximations of scalar functions with constraints
Computers and Graphics
Harmonic functions for quadrilateral remeshing of arbitrary manifolds
Computer Aided Geometric Design - Special issue: Geometry processing
Shape analysis using the auto diffusion function
SGP '09 Proceedings of the Symposium on Geometry Processing
A topological hierarchy for functions on triangulated surfaces
IEEE Transactions on Visualization and Computer Graphics
ConTopo: non-rigid 3D object retrieval using topological information guided by conformal factors
EG 3DOR'11 Proceedings of the 4th Eurographics conference on 3D Object Retrieval
SMI 2013: Steepest descent paths on simplicial meshes of arbitrary dimensions
Computers and Graphics
| Hi-index | 0.00 |
This paper presents a method of shape chartification suitable for surface approximation. The innovation of this approach lies on the definition of an iterative refinement of the shape into a set of patches that are automatically tiled and used to approximate the original shape up to a prescribed error. The coding of the patches is supported by the Reeb graph and contains the rules to properly tile, stitch them, and reconstruct the original shape while preserving its topology, using a technique which is also exploited for reconstructing an object from non-planar contours. The method is geometry-aware by definition, as the nodes of the Reeb graph are representative of the main shape features, which belong to the approximated shape already at the initial iteration steps. The points of the reconstructed shape belong to the original surface, their total number is highly reduced, and the original connectivity is replaced by a set of patches that preserves the global topology of the input shape.