Direct construction of polynomial surfaces from dense range images through region growing
ACM Transactions on Graphics (TOG)
Hierarchical face clustering on polygonal surfaces
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Hierarchical morse complexes for piecewise linear 2-manifolds
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Least squares conformal maps for automatic texture atlas generation
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Partitioning 3D Surface Meshes Using Watershed Segmentation
IEEE Transactions on Visualization and Computer Graphics
Restricted delaunay triangulations and normal cycle
Proceedings of the nineteenth annual symposium on Computational geometry
Molecular shape analysis based upon the morse-smale complex and the connolly function
Proceedings of the nineteenth annual symposium on Computational geometry
Energy-minimizing splines in manifolds
ACM SIGGRAPH 2004 Papers
ACM SIGGRAPH 2004 Papers
Variational shape approximation
ACM SIGGRAPH 2004 Papers
Hierarchical mesh segmentation based on fitting primitives
The Visual Computer: International Journal of Computer Graphics
Spectral surface quadrangulation
ACM SIGGRAPH 2006 Papers
Paper craft models from meshes
The Visual Computer: International Journal of Computer Graphics
Automatic extraction of surface structures in digital shape reconstruction
Computer-Aided Design
TRACKS: toward directable thin shells
ACM SIGGRAPH 2007 papers
Surface tiling with differential topology
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
Principal curvatures from the integral invariant viewpoint
Computer Aided Geometric Design
A study of surface reconstruction for 3D mannequins based on feature curves
Computer-Aided Design
Hi-index | 0.00 |
The structuring of surface meshes is a labor intensive task in reverse engineering. For example, in CAD, scanned triangle meshes must be divided into characteristic/uniform patches to enable conversion into high-level spline surfaces. Typical industrial techniques, like rolling ball blends, are very labor intensive. We provide a novel, robust and quick algorithm for the automatic generation of a patch layout based on a topology consistent feature graph. The graph separates the surface along feature lines into functional and geometric building blocks. Our algorithm then thickens the edges of the feature graph and forms new regions with low varying curvature. Further, these new regions-so-called fillets and node patches-will have highly smooth boundary curves, making the algorithm an ideal preprocessor for a subsequent spline fitting algorithm.