Approximating Points by a Piecewise Linear Function: I

DOI10.1007/978-3-642-10631-6_24zbMath1272.52008OpenAlexW1839084417MaRDI QIDQ3652208

Danny Z. Chen, Haitao Wang

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_24

Mathematics Subject Classification ID

Data structures (68P05) Approximation algorithms (68W25) Approximation by convex sets (52A27)

Related Items (8)

A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting ⋮ Linear-time fitting of a \(k\)-step function ⋮ Fitting a two-joint orthogonal chain to a point set ⋮ A note on searching line arrangements and applications ⋮ Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures ⋮ Outlier respecting points approximation ⋮ Linear-Time Fitting of a k-Step Function ⋮ Piecewise Linear Function Fitting via Mixed-Integer Linear Programming

This page was built for publication: Approximating Points by a Piecewise Linear Function: I