Curve interpolation with constrained length

DOI10.1007/BF02238080MaRDI QIDQ1343679zbMATH OpenFDO

Authors V. Pereyra

Publication date 30 January 1995

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02238080

zbMATH Keywords

shape preserving

Mathematics Subject Classification ID

Spline approximation (41A15) Numerical computation using splines (65D07)

Review text

We consider the problem of finding a curve which interpolates at given points such that (approximately) the length of the curve between each two subsequent interpolation points is equal to some given number. We only consider the functional case. We give an algorithm which yields an interpolating cubic polynomial spline. In case the data is taken from a (smooth enough) function this spline function converges at least quadratically in the mesh size to the original one. If the mesh is `regular enough' it is even third order accurate. We also give an extension to the bivariate case. For the univariate case it will be shown that the length on each interval of this constructed spline at most differs quadratically in the mesh size from the actual lengths. Assuming regularity on the partition this estimate can also be improved by one order.

Recommendations

Cites work

Cited in

(15)

Describes a project that uses

Uses Software

pchip

This page was built for publication: Curve interpolation with constrained length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1343679)