Polyline fitting of planar points under min-sum criteria

Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama

研究成果: Article査読

15 被引用数 (Scopus)

抄録

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 L2-metrics, which are more appropriate measures than uniform and Hausdorff metrics in statistical context. We presentefficient algorithms for the 1-joint versions of the problem and fully polynomial-time approximation schemes for the general k-joint versions.

本文言語English
ページ(範囲)97-116
ページ数20
ジャーナルInternational Journal of Computational Geometry and Applications
16
2-3
DOI
出版ステータスPublished - 2006 6

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Theory and Mathematics
  • Computational Mathematics
  • Applied Mathematics

フィンガープリント 「Polyline fitting of planar points under min-sum criteria」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル