Polyline fitting of planar points under min-sum criteria

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

    Research output: Contribution to journalArticle

    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 2metrics, 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 languageEnglish (US)
    Pages (from-to)77-88
    Number of pages12
    JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume3341
    StatePublished - Dec 1 2004

      Fingerprint

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this