A recursive evaluation algorithm for a class of Catmull-Rom splines

  • Authors:
  • Phillip J. Barry;Ronald N. Goldman

  • Affiliations:
  • Computer Graphics Laboratory, Computer Science Dept., Univ. of Waterloo, Waterloo, Ontario, Canada N2L 3G1;Computer Graphics Laboratory, Computer Science Dept., Univ. of Waterloo, Waterloo, Ontario, Canada N2L 3G1

  • Venue:
  • SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is known that certain Catmull-Rom splines [7] interpolate their control vertices and share many properties such as affine invariance, global smoothness, and local control with B-spline curves; they are therefore of possible interest to computer aided design. It is shown here that another property a class of Catmull-Rom splines shares with B-spline curves is that both schemes possess a simple recursive evaluation algorithm. The Catmull-Rom evaluation algorithm is constructed by combining the de Boor algorithm for evaluating B-spline curves with Neville's algorithm for evaluating Lagrange polynomials. The recursive evaluation algorithm for Catmull-Rom curves allows rapid evaluation of these curves by pipelining with specially designed hardware. Furthermore it facilitates the development of new, related curve schemes which may have useful shape parameters for altering the shape of the curve without moving the control vertices. It may also be used for constructing transformations to Bézier and B-spline form.