Shape-preserving knot removal

@article{Schumaker1996ShapepreservingKR,
  title={Shape-preserving knot removal},
  author={Larry L. Schumaker and Sonya S. Stanley},
  journal={Computer Aided Geometric Design},
  year={1996},
  volume={13},
  pages={851-872}
}
Starting with a shape-preserving C 1 quadratic spline, we show how knots can be removed to produce a new spline which is within a speciied tolerance of the original one, and which has the same shape properties. We give speciic algorithms and some numerical examples, and also show how the method can be used to compute approximate best free-knot splines. Finally, we discuss how to handle noisy data, and develop an analogous knot removal algorithm for a monotonicity preserving surface method. The… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Fitting monotone surfaces to scattered data using C1

L. Han, L. Schumaker
1995

A method for computing best segment

H. Wolters
1993

Knot Insertion and Deletion Algorithms for B

R. Goldman, T. Lyche, eds
1993

Bivariate spline approximation by penalized least squares

N. Weyrich
1992

Knot removal for spline curves and surfaces, in Approximation Theory

T. Lyche
1992

Constrained spline approximation

E. Arge, M. Daehlen, T. Lyche, M K.
RKEN • 1990

Data tting by penalized least squares

M. von Golitschek, L. Schumaker
1990

A fast `Monte-Carlo cross-validation' procedure for large least squares

D. Girard
1989

Approximation by Spline Functions, Springer-Verlag, Berlin

G. urnberger
1989

A data reduction strategy for splines

T. Lyche, M K.
RKEN • 1988

Similar Papers

Loading similar papers…