An on-line algorithm for fitting straight lines between data ranges
From MaRDI portal
Publication:3916032
DOI10.1145/358746.358758zbMath0464.68074OpenAlexW2033836415MaRDI QIDQ3916032
Publication date: 1981
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/358746.358758
Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Algorithms for approximation of functions (65D15) Discrete mathematics in relation to computer science (68R99) Theory of software (68N99)
Related Items (20)
Finding transversals for sets of simple geometric figures ⋮ Approximating points by a piecewise linear function ⋮ FITTING A STEP FUNCTION TO A POINT SET WITH OUTLIERS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES ⋮ Top-\(k\) frequent items and item frequency tracking over sliding windows of any size ⋮ Representing a functional curve by curves with fewer peaks ⋮ Linear approximation of simple objects ⋮ Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures ⋮ Linear approximation of simple objects ⋮ Unsupervised Polygonal Reconstruction of Noisy Contours by a Discrete Irregular Approach ⋮ Stabbing segments with rectilinear objects ⋮ Outlier respecting points approximation ⋮ An Approach for the Estimation of the Precision of a Real Object from its Digitization ⋮ Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity ⋮ Stabbers of line segments in the plane ⋮ Some Discrete Properties of the Space of Line Transversals to Disjoint Balls ⋮ On the performance of learned data structures ⋮ Linear approximation of simple objects ⋮ Computing shortest transversals ⋮ An approach for the estimation of the precision of a real object from its digitization ⋮ Average Curve of n Digital Curves
This page was built for publication: An on-line algorithm for fitting straight lines between data ranges
