Discrete Beta-splines
- 1 August 1987
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGGRAPH Computer Graphics
- Vol. 21 (4) , 137-144
- https://doi.org/10.1145/37402.37419
Abstract
Goodman (1985) and Joe (1986) have given explicit formulas for (cubic) Beta-splines on uniform knot sequences with varying ß1 and ß2 values at the knots, and nonuniform knot sequences with varying ß2 values at the knots, respectively. The advantage of the latter formula is that it can also be used for knot sequences with multiple knots. Discrete Beta-splines arise when a Beta-spline curve is subdivided, i.e. the knot sequence is refined so that the curve is expressed in terms of a larger number of control vertices and Beta-splines. We prove that discrete Beta-splines satisfy the same properties as discrete B-splines, and present an algorithm for computing discrete Beta-splines and the new control vertices using the explicit formula of Joe (1986).Keywords
This publication has 11 references indexed in Scilit:
- Making the Oslo Algorithm More EfficientSIAM Journal on Numerical Analysis, 1986
- Letter to the editorComputer Aided Geometric Design, 1985
- Properties of β-splinesJournal of Approximation Theory, 1985
- The insertion algorithmComputer-Aided Design, 1985
- Generation of ß-spline curves using a recurrence relationPublished by Springer Nature ,1985
- A short proof of the Oslo algorithmComputer Aided Geometric Design, 1984
- Local Control of Bias and Tension in Beta-splinesACM Transactions on Graphics, 1983
- Visually C2 cubic splinesComputer-Aided Design, 1982
- Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphicsComputer Graphics and Image Processing, 1980
- Inserting new knots into B-spline curvesComputer-Aided Design, 1980