### 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 L _{1}- and L^{2}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.

Original language | English (US) |
---|---|

Pages (from-to) | 77-88 |

Number of pages | 12 |

Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Volume | 3341 |

DOIs | |

State | Published - 2004 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Polyline fitting of planar points under min-sum criteria'. Together they form a unique fingerprint.

## Cite this

Aronov, B., Asano, T., Katoh, N., Mehlhorn, K., & Tokuyama, T. (2004). Polyline fitting of planar points under min-sum criteria.

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*,*3341*, 77-88. https://doi.org/10.1007/978-3-540-30551-4_9