Piecewise linear approximations of fewest line segments

Authors:
D. G. Wilson
Affiliations:
Virginia Commonwealth University, Richmond, Virginia
Venue:
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Year:
1971

Citing 2
Cited 1

On the approximation of curves by line segments using dynamic programming

Communications of the ACM
Further remarks on line segment curve-fitting using dynamic programming

Communications of the ACM

A Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Schwerdtfeger 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.