A B-spline curve extension algorithm

Yang Lu, Kanle Shi, Junhai Yong, Hejin Gu*, Haichuan Song

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

B-spline curve extension is an important operation in computer aided design systems. In this paper, we present a new extension algorithm for B-spline curves. The algorithm uses curve unclamping to generate a uniform B-spline curve segment from the original curve and gradually extends the segment to pass through every target point. Algorithms of uniform B-spline curves are used such that our algorithm has a low time cost and can easily handle arbitrary-order derivative constraints at the target points. Generalization for non-uniform rational B-spline curve extension is also discussed, and examples show the efficiency of our method.

Original languageEnglish
Article number32103
JournalScience China Information Sciences
Volume59
Issue number3
DOIs
StatePublished - 1 Mar 2016
Externally publishedYes

Keywords

  • B-spline/NURBS
  • clamping
  • curve extension
  • unclamping
  • uniform

Fingerprint

Dive into the research topics of 'A B-spline curve extension algorithm'. Together they form a unique fingerprint.

Cite this