English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Polyline Fitting of Planar Points under Min-sum Criteria

MPS-Authors
/persons/resource/persons44029

Aronov,  Boris
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44035

Asano,  Tetsuo
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Aronov, B., Asano, T., Katoh, N., Mehlhorn, K., & Tokuyama, T. (2006). Polyline Fitting of Planar Points under Min-sum Criteria. International Journal of Computational Geometry and Applications, 16, 97-116.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-23BA-3
Abstract
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications. We consider fitting a polyline with k joints under the min-sum criteria with respect to L1- and L2 -metrics, which are more appropriate measures than uniform and Hausdorff metrics in statistical context. We present efficient algorithms for the 1-joint versions of the problem and fully polynomial-time approximation schemes for the general k-joint versions.