Abstract
Splines are particularly simple if their knots are all simple and evenly spaced. In this case, the B-splines are translates of each other. As a consequence, there are simple efficient knot insertion algorithms to convert a B-spline representation to a B-spline representation over a finer and also evenly spaced knot sequence. Moreover, these algorithms are the prototypes for the class of the so-called stationary subdivision algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Prautzsch, H., Boehm, W., Paluszny, M. (2002). Uniform subdivision. In: Bézier and B-Spline Techniques. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04919-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-04919-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07842-2
Online ISBN: 978-3-662-04919-8
eBook Packages: Springer Book Archive