Another knot insertion algorithm for B-spline curves (Q1195077)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 68937
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Another knot insertion algorithm for B-spline curves |
scientific article; zbMATH DE number 68937 |
Statements
Another knot insertion algorithm for B-spline curves (English)
0 references
13 October 1992
0 references
A new algorithm for inserting knots into a \(B\)-spline curve is discussed. This algorithm has the efficiency of Boehm's knot insertion algorithm [cf. \textit{W. Boehm}, Inserting new knots into \(B\)-spline curve, Computer- Aided Design 12, 199-202 (1980)] and the depth property of the Oslo algorithm [cf. \textit{E. Cohen, T. Lyche}, and \textit{R. F. Riesenfeld}, Discrete \(B\)-splines and subdivision techniques in computer-aided geometric design and computer graphics, Computer Graphics and Image Processing 14, 87-111 (1980)].
0 references
blossom
0 references
polar form
0 references
\(B\)-spline curve
0 references
knot insertion algorithm
0 references
Oslo algorithm
0 references
0.854164719581604
0 references
0.8504865765571594
0 references
