Skip to main content

Virtual Artistic Paper-Cut

  • Conference paper
Technologies for E-Learning and Digital Entertainment (Edutainment 2008)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5093))

Abstract

This paper presents some algorithms for a novel simulation of the folding and cut crafts in Chinese Paper-cut. All algorithms in simulation are designed by consideration of the real Paper-cut’s whole process. We applies area filling algorithm, polygon clipping algorithm, contour extraction algorithm and subdivision curve algorithm, with the proper improvement that meets the technique of the art in the nature, to yield some vivid Paper-cut works. Our approach is feasible to anyone with the desire, due to Paper-cut illumines itself in 2D and all the operations are also in 2D.Moverover, recent compelling graphic systems, such as Flash, Photoshop, Maya and 3DMax, did not provide a similar interface for paper’s fold and decorative pattern which are primary elements in Paper-cut. However, our approach not only meets the interest of the Paper-cut, but also holds an interface for these compelling systems because of measuring up the SVG.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Yu, J., Luo, G., Peng, Q.: Image Based Synthesis of Chinese Landscape Painting [J]. Journal of Computer Science and Technology 18(1), 22–28 (2003)

    Article  MATH  Google Scholar 

  2. Rogers, D.F.: Procedure Elements for Computer Graphics. McGraw Hill, New York (1985)

    Google Scholar 

  3. Sutherland, I.E., Hodgman, G.W.: Reentrant polygon clipping. Comm. ACM 17(1), 28–352 (1974)

    Article  Google Scholar 

  4. Weiler, K.J., Atherton, P.R.: Hidden surface removal using polygon area sorting. Computer Graphics 11(2), 214–222 (1977)

    Article  Google Scholar 

  5. Donna, W., Mubarak, S.: A fast algorithm for active contours and curvature estimation. CV GIP: Image Understanding 55(1), 14–26 (1992)

    Article  MATH  Google Scholar 

  6. Kass, M., Witkin, A., Terzopoulos, D.: Snake: active contour models. International Journal of Computer Vision 1(4), 321–331 (1998)

    Article  Google Scholar 

  7. Riesenfeld, R.F.: An algorithm for high speed curve generation[A]. Computer Graphics and Image Processing[C] 3(4), 346–349 (1974)

    Article  Google Scholar 

  8. Carstensen, C., Mühlbach, G., Schmidt, G.: De Casteljau’s algorithm is an extrapolation method [J]. Computer Aided Geometric Design 12(4), 371–380 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  9. de Boor, C.: Cutting corners always works [J]. Computer Aided Geometric Design 4(122), 125–131 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  10. The, C.-H., Chin, R.T.: On the Detection of Dominant Pointson Digital Curves [J]. Trans on Pattern Analysis and Machine Intelligence 11(8) (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Zhigeng Pan Xiaopeng Zhang Abdennour El Rhalibi Woontack Woo Yi Li

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guo, H., Shi, M., Hong, Z., Yang, R., Zhang, L. (2008). Virtual Artistic Paper-Cut. In: Pan, Z., Zhang, X., El Rhalibi, A., Woo, W., Li, Y. (eds) Technologies for E-Learning and Digital Entertainment. Edutainment 2008. Lecture Notes in Computer Science, vol 5093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69736-7_75

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69736-7_75

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69734-3

  • Online ISBN: 978-3-540-69736-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics