Abstract
Curves are commonly drawn by piecewise linear interpolation, but to worry about the error is rather seldom. In the present paper we give a strong mathematical error analysis for curve segments with bounded curvature and length. Though the result seems very clear, the proof turned out to be unexpectedly hard, comparable to that of the famous four vertex theorem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Guggenheimer, H.: Differential geometry. McGraw Hill 1963.
Kneser, A.: Festschrift zum 70. Geburtstag von H. Weber, Leipzig 1912.
Muckhopadhaya, S.: Bull. Calcutta Math. Soc. 1 (1909).
La Salle, J. P., Hermes, H.: Functional analysis and time optimal control. North Holland 1991.
J. Steiner (1882) ArticleTitleEinfache Beweise der isoperimetrischen Hauptsätze J. Reine Angew. Math. 18 289–296
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Degen, W.L.F. Sharp error bounds for piecewise linear interpolation of planar curves. Computing 79, 143–151 (2007). https://doi.org/10.1007/s00607-006-0193-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-006-0193-z