We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 19 Issue 5
September  2004
Turn off MathJax
Article Contents
Abstract
Related Articles
Hua-Wei Wang, Kai-Huai Qin. Estimating Subdivision Depth of Catmull-Clark Surfaces[J]. Journal of Computer Science and Technology, 2004, 19(5).
Citation: Hua-Wei Wang, Kai-Huai Qin. Estimating Subdivision Depth of Catmull-Clark Surfaces[J]. Journal of Computer Science and Technology, 2004, 19(5).
shu

Estimating Subdivision Depth of Catmull-Clark Surfaces

More Information
  • Published Date: September 14, 2004
    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.
    • FullText(HTML)
    • References (0)
    • Relative Articles

  • Related Articles

    [1]Yusuf Fatihu Hamza, Hong-Wei Lin. Conjugate-Gradient Progressive-Iterative Approximation for Loop and Catmull-Clark Subdivision Surface Interpolation[J]. Journal of Computer Science and Technology, 2022, 37(2): 487-504. DOI: 10.1007/s11390-020-0183-1
    [2]Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Th&oumlle, Henning Thomas. Approximation Algorithms for 3D Orthogonal Knapsack[J]. Journal of Computer Science and Technology, 2008, 23(5): 749-762.
    [3]Qing Ai, Yan-Song Li, Gui-Lu Long. Influences of Gate Operation Errors in the Quantum Counting Algorithm[J]. Journal of Computer Science and Technology, 2006, 21(6): 927-931.
    [4]Jian-Hui Jiang. An Error Recoverable Structure Based on Complementary Logic and Alternating- Retry[J]. Journal of Computer Science and Technology, 2005, 20(6): 885-894.
    [5]JIANG JianHui, MIN YingHua, PENG ChengLian. Fault-Tolerant Systems with Concurrent Error-Locating Capability[J]. Journal of Computer Science and Technology, 2003, 18(2).
    [6]Riadh Robbana. Verification of Duration Systems Using an Approximation Approach[J]. Journal of Computer Science and Technology, 2003, 18(2).
    [7]HE Yong, CHEN Ting. A New Approximation Algorithm for Sorting of Signed Permutations[J]. Journal of Computer Science and Technology, 2003, 18(1).
    [8]LI Yueping, TANG Pushan. Relaxation Algorithm of Piecing-Error for Sub-Images[J]. Journal of Computer Science and Technology, 2001, 16(3).
    [9]ZHANG Li'ang, ZHANG Yin. Approximation for- Knapsack Problemswith Multiple Constraints[J]. Journal of Computer Science and Technology, 1999, 14(4): 289-297.
    [10]Qin Kaihuai, Sun Jiaguang. A New Local Control Spline with Shape Parameters for CAD/CAM[J]. Journal of Computer Science and Technology, 1993, 8(3): 90-98.
    • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (12) PDF downloads (1362) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return