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.
KeywordsError Vector Subdivision Scheme Subdivision Level Line Chain Candidate Vertex
Unable to display preview. Download preview PDF.
- 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
- 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