Another knot insertion algorithm for B-spline curves

Phillip J. Barry; Rui Feng Zhu

doi:10.1016/0167-8396(92)90015-H

Another knot insertion algorithm for B-spline curves

Phillip J. Barry, Rui Feng Zhu

Computer Science and Engineering

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

We present a new algorithm for inserting knots into a B-spline curve. This algorithm combines the speed of Boehm's algorithm with the 'bounded depth' property of the Oslo algorithm-the property that the data flow graphs have depth dependent only on the degree of the curve, and not on the number of knots inserted.

Original language	English (US)
Pages (from-to)	175-183
Number of pages	9
Journal	Computer Aided Geometric Design
Volume	9
Issue number	3
DOIs	https://doi.org/10.1016/0167-8396(92)90015-H
State	Published - Aug 1992

Keywords

B-spline
Boehm's knot insertion algorithm
Goldman knot insertion algorithm
Oslo algorithm
blossom
polar form.

Publisher link

10.1016/0167-8396(92)90015-H

Find It

Find It at U of M Libraries

Cite this

@article{4e1e55de9d5e43f089073addf59c2ae3,

title = "Another knot insertion algorithm for B-spline curves",

abstract = "We present a new algorithm for inserting knots into a B-spline curve. This algorithm combines the speed of Boehm's algorithm with the 'bounded depth' property of the Oslo algorithm-the property that the data flow graphs have depth dependent only on the degree of the curve, and not on the number of knots inserted.",

keywords = "B-spline, Boehm's knot insertion algorithm, Goldman knot insertion algorithm, Oslo algorithm, blossom, polar form.",

author = "Barry, {Phillip J.} and Zhu, {Rui Feng}",

year = "1992",

month = aug,

doi = "10.1016/0167-8396(92)90015-H",

language = "English (US)",

volume = "9",

pages = "175--183",

journal = "Computer Aided Geometric Design",

issn = "0167-8396",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Another knot insertion algorithm for B-spline curves

AU - Barry, Phillip J.

AU - Zhu, Rui Feng

PY - 1992/8

Y1 - 1992/8

N2 - We present a new algorithm for inserting knots into a B-spline curve. This algorithm combines the speed of Boehm's algorithm with the 'bounded depth' property of the Oslo algorithm-the property that the data flow graphs have depth dependent only on the degree of the curve, and not on the number of knots inserted.

AB - We present a new algorithm for inserting knots into a B-spline curve. This algorithm combines the speed of Boehm's algorithm with the 'bounded depth' property of the Oslo algorithm-the property that the data flow graphs have depth dependent only on the degree of the curve, and not on the number of knots inserted.

KW - B-spline

KW - Boehm's knot insertion algorithm

KW - Goldman knot insertion algorithm

KW - Oslo algorithm

KW - blossom

KW - polar form.

UR - http://www.scopus.com/inward/record.url?scp=0026905189&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026905189&partnerID=8YFLogxK

U2 - 10.1016/0167-8396(92)90015-H

DO - 10.1016/0167-8396(92)90015-H

M3 - Article

AN - SCOPUS:0026905189

SN - 0167-8396

VL - 9

SP - 175

EP - 183

JO - Computer Aided Geometric Design

JF - Computer Aided Geometric Design

IS - 3

ER -

Another knot insertion algorithm for B-spline curves

Abstract

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this