Reverse Subdivision

  • Mohamed F. Hassan
  • Neil A. Dodgson
Part of the Mathematics and Visualization book series (MATHVISUAL)


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.


Error Vector Subdivision Scheme Subdivision Level Line Chain Candidate Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    G. M. Chaikin. An algorithm for high-speed curve generation. Computer Graphics and Image Processing, 3:346–349, 1974.Google Scholar
  2. 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. 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. 4.
    Andrei Khodakovsky, Peter Schröder, and Wim Sweldens. Progressive geometry compression. In Proc. ACM SIGGRAPH 2000, pages 271–278, 2000.Google Scholar
  5. 5.
    C. T. Loop. Smooth subdivision surfaces based on triangles. Master's thesis, University of Utah, Department of Mathematics, 1987.Google Scholar
  6. 6.
    R. F. Riesenfeld. On Chaikin's algorithm. Computer Graphics and Image Processing, 4:304–310, 1975.Google Scholar
  7. 7.
    F. Samavati and R. Bartels. Multiresolution curve and surface representation by reversing subdivision rules. Computer Graphics Forum, 18(2):97–119, 6 1999.CrossRefGoogle Scholar
  8. 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.CrossRefGoogle Scholar
  9. 9.
    E. J. Stollnitz, T. D. DeRose, and D. H. Salesin. Wavelets for computer graphics. San Francisco; Morgan Kaufmann Publishers, 1996.Google Scholar
  10. 10.
    Vitaly Surazhsky and Craig Gotsman. Explicit surface remeshing. In Proc. Eurographics Symposium on Geometry Processing, pages 17–28, June 2003.Google Scholar
  11. 11.
    G. Taubin. Detecting and reconstructing subdivision connectivity. Visual Computer, 2002.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Mohamed F. Hassan
    • 1
  • Neil A. Dodgson
    • 1
  1. 1.Computer LaboratoryUniversity of CambridgeUK

Personalised recommendations