Non-uniform B-Spline Subdivision Using Refine and Smooth
Subdivision surfaces would be useful in a greater number of applications if an arbitrary-degree, non-uniform scheme existed that was a generalisation of NURBS. As a step towards building such a scheme, we investigate non-uniform analogues of the Lane-Riesenfeld ‘refine and smooth’ subdivision paradigm. We show that the assumptions made in constructing such an analogue are critical, and conclude that Schaefer’s global knot insertion algorithm is the most promising route for further investigation in this area.
Unable to display preview. Download preview PDF.
- 3.Gasciola, G., Romani, L.: A general matrix representation for non-uniform B-spline subdivision with boundary control. Draft paper (2006)Google Scholar
- 4.Goldman, R., Schaefer, S.: Global Knot Insertion Algorithms. Presentation at the University of Kaiserslautern (January 17, 2007)Google Scholar
- 9.Ramshaw, L.: Blossoming: A Connect-the-Dots Approach to Splines. Technical Report 19, Digital Systems Research Center (1987)Google Scholar
- 10.Sederberg, T., Zheng, J., Sewell, D., Sabin, M.: Non-Uniform Recursive Subdivision Surfaces. In: Proceedings of the 25th annual conference on Computer Graphics and Interactive Techniques, pp. 387–394 (1998)Google Scholar
- 11.Warren, J.: Binary subdivision schemes for functions over irregular knot sequences. In: Dæhlen, M., Lyche, T., Schumaker, L.L. (eds.) Mathematical Methods for Curves and Surfaces. Vanderbilt U.P, pp. 543–562 (1995)Google Scholar