Efficient, fair interpolation using Catmull-Clark surfaces
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
An extension of Chaiken's algorithm to B-spline curves with knots in geometric progression
CVGIP: Graphical Models and Image Processing
Analysis of Algorithms Generalizing B-Spline Subdivision
SIAM Journal on Numerical Analysis
Non-uniform recursive subdivision surfaces
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
ACM SIGGRAPH 2003 Papers
Extended subdivision surfaces: Building a bridge between NURBS and Catmull-Clark surfaces
ACM Transactions on Graphics (TOG)
Concentric tessellation maps and curvature continuous guided surfaces
Computer Aided Geometric Design
Non-uniform subdivision for B-splines of arbitrary degree
Computer Aided Geometric Design
A symmetric, non-uniform, refine and smooth subdivision algorithm for general degree B-splines
Computer Aided Geometric Design
Non-uniform B-spline subdivision using refine and smooth
Proceedings of the 12th IMA international conference on Mathematics of surfaces XII
Beyond Catmull–Clark? A Survey of Advances in Subdivision Surface Methods
Computer Graphics Forum
| Hi-index | 0.00 |
We introduce a non-uniform subdivision algorithm that partitions the neighborhood of an extraordinary point in the ratio @s:1-@s, where @s@?(0,1). We call @s the speed of the non-uniform subdivision and verify C^1 continuity of the limit surface. For @s=1/2, the Catmull-Clark limit surface is recovered. Other speeds are useful to vary the relative width of the polynomial spline rings generated from extraordinary nodes.