A plene cubic spline segment is given. We wont to epproximote Its offset line by another cubic spline segment. Therefore we take the known curvotures end tangents ot the endpoints of the offset line end colculete the corresponding spline. Finally examples ore given.
โฆ LIBER โฆ
Local approximation by cubic splines
โ Scribed by V.S. Yuferev
- Publisher
- Elsevier Science
- Year
- 1981
- Weight
- 369 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0041-5553
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
An offset spline approximation for plane
โ
Reinhold Klass
๐
Article
๐
1983
๐
Elsevier Science
๐
English
โ 157 KB
A subroutine for approximation by cubic
โ
J. Bok
๐
Article
๐
1978
๐
Elsevier Science
๐
English
โ 292 KB
## BELLS mental data points (not necessarily equidistant) by a sum of the cubic bell spline [1] functions in the least squares sense.
A local algorithm for constructing non-n
โ
Bernd Fischer; Gerhard Opfer; Madan L Puri
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 890 KB
Global and local date reduction strategi
โ
U.A. Wever
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 353 KB
Global and local algorithms are developed, which minimize the number of knots of approximating cubic spline functions within a given deviation in the uniform norm. The global algorithm leads to a good approach to the minimum number of knots. The local algorithm saves computing time but generally lea
Interproximation: interpolation and appr
โ
F. Cheng; B.A. Barsky
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 398 KB
Local approximation properties of spline
โ
Stephen Demko
๐
Article
๐
1977
๐
Elsevier Science
๐
English
โ 593 KB