Further remarks on line segment curve-fitting using dynamic programming
From MaRDI portal
Publication:5722561
DOI10.1145/368637.368753zbMath0114.32901OpenAlexW1981425894MaRDI QIDQ5722561
Publication date: 1962
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/368637.368753
Related Items (6)
Approximation and allocation ⋮ On the approximation of trajectories and its applications to control systems optimization problems ⋮ Uniform partition and the best least-squares piecewise polynomial approximation ⋮ An algorithm for continuous piecewise linear bounding of discrete time series data ⋮ Segmental differential approximation and the 'black box' problem ⋮ Uniform piecewise polynomial approximation with variable joints
This page was built for publication: Further remarks on line segment curve-fitting using dynamic programming
