Fréchet distance for curves, revisited

Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We revisit the problem of computing the Fréchet distance between polygonal curves, focusing on the discrete Fréchet distance, where only distance between vertices is considered. We develop efficient approximation algorithms for two natural classes of curves: κ-bounded curves and backbone curves, the latter of which are widely used to model molecular structures. We also propose a pseudo-output-sensitive algorithm for computing the discrete Fréchet distance exactly. The complexity of the algorithm is a function of the complexity of the free-space boundary, which is quadratic in the worst case, but tends to be lower in practice.

    Original languageEnglish (US)
    Title of host publicationAlgorithms, ESA 2006 - 14th Annual European Symposium, Proceedings
    Pages52-63
    Number of pages12
    Volume4168 LNCS
    StatePublished - 2006
    Event14th Annual European Symposium on Algorithms, ESA 2006 - Zurich, Switzerland
    Duration: Sep 11 2006Sep 13 2006

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume4168 LNCS
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other14th Annual European Symposium on Algorithms, ESA 2006
    CountrySwitzerland
    CityZurich
    Period9/11/069/13/06

    Fingerprint

    Curve
    Approximation algorithms
    Molecular structure
    Molecular Structure
    Computing
    Free Space
    Backbone
    Approximation Algorithms
    Efficient Algorithms
    Tend
    Output
    Model
    Class

    ASJC Scopus subject areas

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

    Cite this

    Aronov, B., Har-Peled, S., Knauer, C., Wang, Y., & Wenk, C. (2006). Fréchet distance for curves, revisited. In Algorithms, ESA 2006 - 14th Annual European Symposium, Proceedings (Vol. 4168 LNCS, pp. 52-63). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4168 LNCS).

    Fréchet distance for curves, revisited. / Aronov, Boris; Har-Peled, Sariel; Knauer, Christian; Wang, Yusu; Wenk, Carola.

    Algorithms, ESA 2006 - 14th Annual European Symposium, Proceedings. Vol. 4168 LNCS 2006. p. 52-63 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4168 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Aronov, B, Har-Peled, S, Knauer, C, Wang, Y & Wenk, C 2006, Fréchet distance for curves, revisited. in Algorithms, ESA 2006 - 14th Annual European Symposium, Proceedings. vol. 4168 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4168 LNCS, pp. 52-63, 14th Annual European Symposium on Algorithms, ESA 2006, Zurich, Switzerland, 9/11/06.
    Aronov B, Har-Peled S, Knauer C, Wang Y, Wenk C. Fréchet distance for curves, revisited. In Algorithms, ESA 2006 - 14th Annual European Symposium, Proceedings. Vol. 4168 LNCS. 2006. p. 52-63. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Aronov, Boris ; Har-Peled, Sariel ; Knauer, Christian ; Wang, Yusu ; Wenk, Carola. / Fréchet distance for curves, revisited. Algorithms, ESA 2006 - 14th Annual European Symposium, Proceedings. Vol. 4168 LNCS 2006. pp. 52-63 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{932217e1d95e4296b2a9cd0828eb1282,
    title = "Fr{\'e}chet distance for curves, revisited",
    abstract = "We revisit the problem of computing the Fr{\'e}chet distance between polygonal curves, focusing on the discrete Fr{\'e}chet distance, where only distance between vertices is considered. We develop efficient approximation algorithms for two natural classes of curves: κ-bounded curves and backbone curves, the latter of which are widely used to model molecular structures. We also propose a pseudo-output-sensitive algorithm for computing the discrete Fr{\'e}chet distance exactly. The complexity of the algorithm is a function of the complexity of the free-space boundary, which is quadratic in the worst case, but tends to be lower in practice.",
    author = "Boris Aronov and Sariel Har-Peled and Christian Knauer and Yusu Wang and Carola Wenk",
    year = "2006",
    language = "English (US)",
    isbn = "3540388753",
    volume = "4168 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "52--63",
    booktitle = "Algorithms, ESA 2006 - 14th Annual European Symposium, Proceedings",

    }

    TY - GEN

    T1 - Fréchet distance for curves, revisited

    AU - Aronov, Boris

    AU - Har-Peled, Sariel

    AU - Knauer, Christian

    AU - Wang, Yusu

    AU - Wenk, Carola

    PY - 2006

    Y1 - 2006

    N2 - We revisit the problem of computing the Fréchet distance between polygonal curves, focusing on the discrete Fréchet distance, where only distance between vertices is considered. We develop efficient approximation algorithms for two natural classes of curves: κ-bounded curves and backbone curves, the latter of which are widely used to model molecular structures. We also propose a pseudo-output-sensitive algorithm for computing the discrete Fréchet distance exactly. The complexity of the algorithm is a function of the complexity of the free-space boundary, which is quadratic in the worst case, but tends to be lower in practice.

    AB - We revisit the problem of computing the Fréchet distance between polygonal curves, focusing on the discrete Fréchet distance, where only distance between vertices is considered. We develop efficient approximation algorithms for two natural classes of curves: κ-bounded curves and backbone curves, the latter of which are widely used to model molecular structures. We also propose a pseudo-output-sensitive algorithm for computing the discrete Fréchet distance exactly. The complexity of the algorithm is a function of the complexity of the free-space boundary, which is quadratic in the worst case, but tends to be lower in practice.

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

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

    M3 - Conference contribution

    AN - SCOPUS:33750699629

    SN - 3540388753

    SN - 9783540388753

    VL - 4168 LNCS

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 52

    EP - 63

    BT - Algorithms, ESA 2006 - 14th Annual European Symposium, Proceedings

    ER -