Curve interpolation based on Catmull-Clark subdivision scheme*
Source abstract
Abstract
Abstract An efficient algorithm for curve interpolation is proposed. The algorithm can produce a subdivision surface that can interpolate the predefined cubic B-spline curves by applying the Catmull-Clark scheme to a polygonal mesh containing symmetric zonal meshes which possesses some special properties. Many kinds of curve interpolation problems can be dealt with by this algorithm such as interpolating single open curve or closed curve a mesh of nonintersecting or intersecting curve. The interpolating surface is C 2 everywhere excepting at a finite number of points. At the same time, sharp creases can also be modeled on the limit subdivision surface by duplicating the vertices of the tagged edges of initial mesh.i. e. the surface is only C 0 along the cubic B-spline curve that is defined by the tagged edges. Because of being simple and easy to implement, this method can be used for product shape design and graphic software development.
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Advanced Numerical Analysis Techniques · Manufacturing Process and Optimization
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References (19)
Show source-provided references
1. ChenG.D.Integral computation relating to rational curves with approximate degree reduction Progress in Natural Science 20001011851851
2. WangG.J.New algorithms for evaluating parametric surface Progress in Natural Science 2001112142142
3. ShouH.H.Affine arithmetic in matrix form for polynomial evaluation and algebraic curve drawing Progress in Natural Science 20021217777
4. ChenD.R.Developable Bézier function surfaces Progress in Natural Science 2002125383383
5. ZhangH.X.Semi-stationary subdivision operators and their applications in geometric modeling Progress in Natural Science 20021210772772
6. Chaikin, G. (1974) An algorithm for high speed generation Computer Graphics & Image Processing, 3(4), pp. 346 - 346.10.1016/0146-664X(74)90028-8 ↗
7. RiesenfeldR.F.On Chaikin's algorithm Computer Graphics & Image Processing 197543304304
8. DooD.Behavior of recursive division surfaces near extraordinary points CAD 106356356
9. CatmullE.Recursively generated B-spline surfaces on arbitrary topological meshes CAD 1978106350350
10. PetersJ.The simplest subdivision scheme for smoothly polyhedra ACM Transaction on Graphics 1997164420420
11. QinH.Dynamic Catmull-Clark subdivision surfaces IEEE Transaction on Visualization and Computer Graphics 199843215215
12. DynN.A butterfly subdivision scheme for surface interpolation with tension control ACM Transaction on Graphics 199092160160
13. ZorinD.Interpolating subdivision for meshes with arbitrary topology Proceedings of Siggraph '96 1996189189In
14. Kobbelt, L. (1996) A variational approach to subdivision Computer Aided Geometric Design, 13, pp. 743 - 743.10.1016/0167-8396(96)00007-6 ↗
15. Nasri, A. (1987) Polyhedral subdivision method for free form surfaces ACM Transaction on Graphics, 8(1), pp. 89 - 89.
16. HalsteadM.Efficient fair interpolation using Catmull-Clark surfaces Proceedings of Siggraph '93 19933535In
17. Nasri, A. (2000) Recursive subdivision of polygonal complexes and its applications in computer-aided geometric design Computer Aided Geometric Design, 17, pp. 595 - 595.10.1016/S0167-8396(00)00015-7 ↗
18. Levin, A.(1999) Interpolating nets of curves by smooth subdivision surfaces. In Proceedings of Siggraph '99. ( pp. 57 - 57 ). In
19. Levin, A. (1999) Combined subdivision schemes for the design of surfaces satisfying boundary conditions Computer Aided Geometric Design, 16, pp. 345 - 345.10.1016/S0167-8396(98)00051-X ↗