Advertisement

Journal of Computer Science and Technology

, Volume 19, Issue 5, pp 657–664 | Cite as

Estimating subdivision depth of Catmull-Clark surfaces

  • Hua-Wei WangEmail author
  • Kai-Huai Qin
Article

Abstract

In this paper, both general and exponential bounds of the distance between a uniform Catmull-Clark surface and its control polyhedron are derived. The exponential bound is independent of the process of subdivision and can be evaluated without recursive subdivision. Based on the exponential bound, we can predict the depth of subdivision within a user-specified error tolerance. This is quite useful and important for pre-computing the subdivision depth of subdivision surfaces in many engineering applications such as surface/surface intersection, mesh generation, numerical control machining and surface rendering.

Keywords

Catmull-Clark surface subdivision depth control polyhedron approximation error 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Catmull E, Clark J. Recursively generated B-spline surfaces on arbitrary topological meshes.Computer-Aided Design, 1978, 10: 350–355.CrossRefGoogle Scholar
  2. [2]
    Stam J. Exact evaluation of Catmull-Clark subdivision surfaces at arbitrary parameter values.Computer Graphics (Proc. SIGGRAPH'98), 1998, 32: 395–404.CrossRefGoogle Scholar
  3. [3]
    Cheng F. Estimating subdivision depths for rational curves and surfaces.ACM Trans. Graphics, 1992, 11(2): 140–151.zbMATHCrossRefGoogle Scholar
  4. [4]
    Cohen E, Schumaker L L. Rates of convergence of control polygons.Computer Aided Geometric Design, 1985, 2: 229–235.zbMATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    Lutterkort D, Peters J. The distance between a uniform B-spline and its control polygon. Technical Report TR-98-013, available from http://www.cise.uft.edu/research/tech-reports.Google Scholar
  6. [6]
    Nairn D, Peters J, Lutterkort D. Sharp, quantitative bounds on the distance between a polynomial piece and its Bezier control polygon.Computer Aided Geometric Design, 1990, 16: 613–631.CrossRefMathSciNetGoogle Scholar
  7. [7]
    Prautzsch H, Kobbelt L. Convergence of subdivision and degree elevation.Adv. Comp. Math., 1994, 2: 143–154.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [8]
    Reif U. Best bounds on the approximation of polynomials and splines by their control structure.Computer Aided Geometric Design, 2000, 17: 579–589.zbMATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    Wang H, Guan Y, Qin K. Error estimate for Doo-Sabin surfaces.Progress in Natural Science, 2002, 12(9): 695–700.zbMATHMathSciNetGoogle Scholar
  10. [10]
    Kobbelt L, Daubert K, Seidel H. Ray tracing of subdivision surfaces.Eurographics Rendering Workshop, 1998, Vienna, Austria, pp. 69–80.Google Scholar
  11. [11]
    Ball A A, Storry D J T. A matrix approach to the analysis of recursively generated B-spline surfaces.Computer-Aided Design, 1986, 18: 437–442.CrossRefGoogle Scholar
  12. [12]
    Qin K, Wang H. Continuity of non-uniform recursive subdivision surfaces.Science in China (Series E), 2000, 43(5): 461–472.zbMATHMathSciNetGoogle Scholar
  13. [13]
    Woodward C D. Cross-sectional design of B-spline surfaces.Computers and Graphics, 1987, 11(2): 193–201.CrossRefGoogle Scholar
  14. [14]
    Halstead M, Kass M, DeRose T. Efficient, fair interpolation using Catmull-Clark surfaces.Computer Graphics (Proc. SIGGRAPH'93), 1993, 27: 35–44.CrossRefGoogle Scholar
  15. [15]
    Hausdorff F. Set Theory, Chelsea (Translated from German), 1978.Google Scholar
  16. [16]
    Sederberg T W, Zheng J, Sewell D, Sabin M. Nonuniform recursive subdivision surfaces.Computer Graphics (Proc. SIGGRAPH'98), 1998, 32: 387–394.CrossRefGoogle Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc., Beijing China and Allerton Press Inc. 2004

Authors and Affiliations

  1. 1.Department of Computer Science and TechnologyTsinghua UniversityBeijingP.R. China

Personalised recommendations