Another knot insertion algorithm for B-spline curves

Phillip J. Barry, Rui Feng Zhu

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


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 languageEnglish (US)
Pages (from-to)175-183
Number of pages9
JournalComputer Aided Geometric Design
Issue number3
StatePublished - Aug 1992


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


Dive into the research topics of 'Another knot insertion algorithm for B-spline curves'. Together they form a unique fingerprint.

Cite this