Algorithms for degree raising of splines
Elaine Cohen, Tom Lyche, Larry L. Schumaker
In ACM Transactions on Graphics, 4(3), 1985.
Abstract: Stable and efficient algorithms for degree-raising of curves (or surfaces) represented as arbitrary B-splines are presented as a application of the solution to the theoretical problem of rewriting a curve written as a linear combination of mth order B-splines as a linear combination of (m + 1)st order B-splines with a minimal number of knot insertions. This approach can be used to introduce additional degrees of freedom to a curve (or surface), a problem which naturally arises in certain circumstances in constructing mathematical models for computer-aided geometric design.
BibTeX format:
@article{Cohen:1985:AFD,
  author = {Elaine Cohen and Tom Lyche and Larry L. Schumaker},
  title = {Algorithms for degree raising of splines},
  journal = {ACM Transactions on Graphics},
  volume = {4},
  number = {3},
  pages = {171--181},
  year = {1985},
}
Search for more articles by Elaine Cohen.
Search for more articles by Tom Lyche.
Search for more articles by Larry L. Schumaker.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."