Optimal surface reconstruction from planar contours
Communications of the ACM
Least squares conformal maps for automatic texture atlas generation
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Hierarchical mesh decomposition using fuzzy clustering and cuts
ACM SIGGRAPH 2003 Papers
Making papercraft toys from meshes using strip-based approximate unfolding
ACM SIGGRAPH 2004 Papers
Feature sensitive mesh segmentation
Proceedings of the 2006 ACM symposium on Solid and physical modeling
Simultaneous shape decomposition and skeletonization
Proceedings of the 2006 ACM symposium on Solid and physical modeling
Mesh Segmentation - A Comparative Study
SMI '06 Proceedings of the IEEE International Conference on Shape Modeling and Applications 2006
Paper craft models from meshes
The Visual Computer: International Journal of Computer Graphics
Plumber: a method for a multi-scale decomposition of 3D shapes into tubular primitives and bodies
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
| Hi-index | 0.00 |
We introduce an algorithm for approximating a 2-manifold 3D mesh by a set of developable surfaces. Each developable surface is a generalized cylinder represented as a strip of triangles not necessarily taken from the original mesh. Our algorithm is automatic, creates easy-to-assemble pieces, and provides L"@K global error bounds. The algorithm consists of three stages. In the first stage, the mesh is segmented into meaningful components. The second stage approximates each of the mesh components in 3D by a set of triangle strips with smooth (non-jagged) boundaries that guarantee a maximal user-defined error relative to the original mesh. Finally, these strips are unfolded to the plane, resulting in flat patterns, which may be cut and assembled from paper. The approximation quality is controlled by a user-supplied parameter specifying the allowed Hausdorff distance between the input mesh and its piecewise-developable approximation. The strips generated by our algorithm may be parameterized to conform with the parameterization of the original mesh, if given, to facilitate texture mapping. We demonstrate this by physically assembling paper-craft models from the strips generated by our algorithm when run on several polygonal 3D mesh data sets.