Further remarks on line segment curve-fitting using dynamic programming

Authors:
Brian Gluss
Affiliations:
Armour Research Foundation of Illinois Institute of Technology, IL
Venue:
Communications of the ACM
Year:
1962

Citing 2
Cited 5

On the approximation of curves by line segments using dynamic programming

Communications of the ACM
Dynamic Programming

Dynamic Programming

Least squares fitting of planes to surfaces using dynamic programming

Communications of the ACM
Relation-based aggregation: finding objects in large spatial datasets

Intelligent Data Analysis
Piecewise linear approximations of fewest line segments

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Waveform Segmentation Through Functional Approximation

IEEE Transactions on Computers
A Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	48.24

Visualization

Abstract

In a recent paper, Bellman showed how dynamic programming could be used to determine the solution to a problem previously considered by Stone. The problem comprises the determination, given N, of the N points of subdivision of a given interval (&agr;, &bgr; and the corresponding line segments, that give the best least squares fit to a function g(x) in the interval. Bellman confined himself primarily to the analytical derivation, suggesting briefly, however, how the solution of the equation derived for each particular point of subdivision ui could be reduced to a discrete search. In this paper, the computational procedure is considered more fully, and the similarities to some of Stone's equations are indicated. It is further shown that an equation for u2 involving no minimization may be found. In addition, it is shown how Bellman's method may be applied to the curve-fitting problem when the additional constraints are added that the ends of the line segments must be on the curve.