Piecewise linear approximations of fewest line segments

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Schwerdtfeger 4,5 has considered the problem of interpolation and curve fitting over a given partition by a sum of continuous sectionally linear functions. He showed how to construct an orthogonal system of these functions over a given partition and how to use this system to obtain an approximation of a given function which is best in the least square sense.

Cite

CITATION STYLE

APA

Wilson, D. G. (1972). Piecewise linear approximations of fewest line segments. In Proceedings of the Spring Joint Computer Conference, AFIPS 1972 (pp. 187–198). Association for Computing Machinery, Inc. https://doi.org/10.1145/1478873.1478898

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free