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 - 2004

    Fingerprint

    Joints
    Statistics
    Polynomials
    Fully Polynomial Time Approximation Scheme
    Hausdorff Metric
    Set of points
    Efficient Algorithms
    Curve
    Context

    ASJC Scopus subject areas

    • Computer Science(all)
    • Biochemistry, Genetics and Molecular Biology(all)
    • Theoretical Computer Science

    Cite this

    Polyline fitting of planar points under min-sum criteria. / Aronov, Boris; Asano, Tetsuo; Katoh, Naoki; Mehlhorn, Kurt; Tokuyama, Takeshi.

    In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 3341, 2004, p. 77-88.

    Research output: Contribution to journalArticle

    @article{30dee1e0b1184a889334dfd8b637f158,
    title = "Polyline fitting of planar points under min-sum criteria",
    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.",
    author = "Boris Aronov and Tetsuo Asano and Naoki Katoh and Kurt Mehlhorn and Takeshi Tokuyama",
    year = "2004",
    language = "English (US)",
    volume = "3341",
    pages = "77--88",
    journal = "Lecture Notes in Computer Science",
    issn = "0302-9743",
    publisher = "Springer Verlag",

    }

    TY - JOUR

    T1 - Polyline fitting of planar points under min-sum criteria

    AU - Aronov, Boris

    AU - Asano, Tetsuo

    AU - Katoh, Naoki

    AU - Mehlhorn, Kurt

    AU - Tokuyama, Takeshi

    PY - 2004

    Y1 - 2004

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=33746197717&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=33746197717&partnerID=8YFLogxK

    M3 - Article

    VL - 3341

    SP - 77

    EP - 88

    JO - Lecture Notes in Computer Science

    JF - Lecture Notes in Computer Science

    SN - 0302-9743

    ER -