Skip to main content

Part of the book series: Mathematics and Visualization ((MATHVISUAL))

Summary

We present a reverse Chaikin algorithm which generates a multiresolution representation of any line chain. It has applications in multiresolution editing and compression. We also sketch how this might be extended to the bivariate Loop subdivision algorithm.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

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. G. M. Chaikin. An algorithm for high-speed curve generation. Computer Graphics and Image Processing, 3:346–349, 1974.

    Google Scholar 

  2. D. Douglas and T. Pücker. Algorithms for the reduction of the number of points required to represent a digitised line or its caricature. The Canadian Cartographer, 10:112–122, 1973.

    Google Scholar 

  3. K. Hormann. An easy way of detecting subdivision connectivity in a triangle mesh. Technical Report 3, Department of Computer Science 9, University of Erlangen, May 2002.

    Google Scholar 

  4. Andrei Khodakovsky, Peter Schröder, and Wim Sweldens. Progressive geometry compression. In Proc. ACM SIGGRAPH 2000, pages 271–278, 2000.

    Google Scholar 

  5. C. T. Loop. Smooth subdivision surfaces based on triangles. Master's thesis, University of Utah, Department of Mathematics, 1987.

    Google Scholar 

  6. R. F. Riesenfeld. On Chaikin's algorithm. Computer Graphics and Image Processing, 4:304–310, 1975.

    Google Scholar 

  7. F. Samavati and R. Bartels. Multiresolution curve and surface representation by reversing subdivision rules. Computer Graphics Forum, 18(2):97–119, 6 1999.

    Article  Google Scholar 

  8. F. Samavati, N. Mahdavi-Amiri, and R. Bartels. Multiresolution surfaces having arbitrary topologies by a reverse Doo subdivision method. Computer Graphics Forum, 21(2):97–119, 6 2002.

    Article  Google Scholar 

  9. E. J. Stollnitz, T. D. DeRose, and D. H. Salesin. Wavelets for computer graphics. San Francisco; Morgan Kaufmann Publishers, 1996.

    Google Scholar 

  10. Vitaly Surazhsky and Craig Gotsman. Explicit surface remeshing. In Proc. Eurographics Symposium on Geometry Processing, pages 17–28, June 2003.

    Google Scholar 

  11. G. Taubin. Detecting and reconstructing subdivision connectivity. Visual Computer, 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hassan, M.F., Dodgson, N.A. (2005). Reverse Subdivision. In: Dodgson, N.A., Floater, M.S., Sabin, M.A. (eds) Advances in Multiresolution for Geometric Modelling. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-26808-1_15

Download citation

Publish with us

Policies and ethics