Skip to main content
SpringerLink
Log in

Paper craft models from meshes

  • Special Issue Paper
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

This paper introduces an algorithm for segmenting a mesh into developable approximations. The algorithm can be used in various applications in CAD and computer graphics. This paper focuses on paper crafting and demonstrates that the algorithm generates approximations that are developable, easy to cut, and can be glued together. It is also shown that the error between the given model and the paper model is small.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Cignoni, P., Rocchini, C., Scopigno, R.: Metro: measuring error on simplified surfaces. Comput. Graph. Forum 17(2), 167–174 (1998)

    Article  Google Scholar 

  2. Cohen-Steiner, D., Alliez, P., Desbrun, M.: Variational shape approximation. ACM Trans. Graph. 23(3), 905–914 (2004)

    Article  Google Scholar 

  3. Duda, R.O., Hart, P.E., Stork, D.: Pattern Classification. John Wiley &Sons, New York (2000)

    Google Scholar 

  4. Garland, M., Willmott, A., Heckbert, P.: Hierarchical face clustering on polygonal surfaces. In: SI3D ’01: Proceedings of the 2001 symposium on Interactive 3D graphics, pp. 49–58 (2001)

  5. Guskov, I., Vidimce, K., Sweldens, W., Schroder, P.: Normal meshes. In: SIGGRAPH, pp. 95–102 (2000)

  6. Igarashi, T., Cosgrove, D.: Adaptive unwrapping for interactive texture painting. In: SI3D ’01: Proceedings of the 2001 symposium on Interactive 3D graphics, pp. 209–216 (2001)

  7. Julius, D., Kraevoy, V., Sheffer, A.: D-charts: Quasi-developable mesh segmentation. In: Comput. Graph. Forum, vol. 24, pp. 581–590. Eurographics, Blackwell, Dublin, Ireland (2005)

    Google Scholar 

  8. Katz, S., Leifman, G., Tal, A.: Mesh segmentation using feature point and core extraction. Visual Comput. 21(8–10), 865–875 (2005)

    Google Scholar 

  9. Katz, S., Tal, A.: Hierarchical mesh decomposition using fuzzy clustering and cuts. ACM Trans. Graph. (SIGGRAPH) 22(3), 954–961 (2003)

    Article  Google Scholar 

  10. Kleppner, D., Kolenkow, R.J.: An Introduction to Mechanics. McGraw-Hill (1973)

  11. Krishnamurthy, V., Levoy, M.: Fitting smooth surfaces to dense polygon meshes. In: SIGGRAPH ’96: Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, pp. 313–324 (1996)

  12. Lee, Y., Lee, S., Shamir, A., Cohen-Or, D., Seidel, H.P.: Intelligent mesh scissoring using 3d snakes. In: Pacific Conference on Computer Graphics and Applications, pp. 279–287 (2004)

  13. Levy, B., Petitjean, S., Ray, N., Maillot, J.: Least squares conformal maps for automatic texture atlas generation. In: SIGGRAPH, pp. 362–371 (2002)

  14. Liu, R., Zhang, H.: Segmentation of 3d meshes through spectral clustering. In: Pacific Conference on Computer Graphics and Applications, pp. 298–305 (2004)

  15. Maillot, J., Yahia, H., Verroust, A.: Interactive texture mapping. In: SIGGRAPH, pp. 27–34 (1993)

  16. Mitani, J., Suzuki, H.: Making papercraft toys from meshes using strip-based approximate unfolding. ACM Trans. Graph. 23(3), 259–263 (2004)

    Article  Google Scholar 

  17. Mortara, M., Patanè, G., Spagnuolo, M., Falcidieno, B., Rossignac, J.: Plumber: A multi-scale decomposition of 3d shapes into tubular primitives and bodies. Proc. of Solid Modeling and Applications pp. 139–158 (2004)

  18. Sander, P., Snyder, J., Gortler, S., Hoppe, H.: Texture mapping progressive meshes. In: SIGGRAPH, pp. 409–416 (2001)

  19. Sander, P., Wood, Z., Gortler, S., Snyder, J., Hoppe, H.: Multi-chart geometry images. In: Eurographics/ACM SIGGRAPH symposium on Geometry processing, pp. 146–155 (2003)

  20. Shamir, A.: A formalization of boundary mesh segmentation. In: Proceedings of the second International Symposium on 3DPVT (2004)

  21. Shlafman, S., Tal, A., Katz, S.: Metamorphosis of polyhedral surfaces using decomposition. Comput. Graph. Forum 21(3), 219–228 (2002)

    Article  Google Scholar 

  22. Taubin, G.: Estimation of planar curves, surfaces, and nonplanar space curves defined by implicit equations with applications to edge and range image segmentation. IEEE Trans. Patt. Anal. Mach. Intell. 13(11), 1115–1138 (1991)

    Article  Google Scholar 

  23. Wu, J., Kobbelt, L.: Structure recovery via hybrid variational surface approximation. Comput. Graph. Forum 24(3), 277–284 (2005)

    Article  Google Scholar 

  24. Yamauchi, H., Gumhold, S., Zayer, R., Seidel, H.P.: Mesh segmentation driven by gaussian curvature. Visual Comput. 21(8–10), 659–668 (2005)

    Article  Google Scholar 

  25. Zhou, K., Synder, J., Guo, B., Shum, H.Y.: Iso-charts: Stretch-driven mesh parameterization using spectral analysis. In: Eurographics/ACM SIGGRAPH symposium on Geometry processing, pp. 45–54 (2004)

  26. Zhou, Y., Huang, Z.: Decomposing polygon meshes by means of critical points. In: MMM, pp. 187–195 (2004)

  27. Zuckerberger, E., Tal, A., Shlafman, S.: Polyhedral surface decomposition with applications. Comput. Graph. 26(5), 733–743 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Technion, Haifa, Israel

    Idan Shatz, Ayellet Tal & George Leifman

Authors
  1. Idan Shatz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ayellet Tal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. George Leifman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ayellet Tal.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shatz, I., Tal, A. & Leifman, G. Paper craft models from meshes. Visual Comput 22, 825–834 (2006). https://doi.org/10.1007/s00371-006-0067-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-006-0067-6

Keywords

Search

Navigation