Computing the Fréchet distance between simple polygons

K. Buchin, M. Buchin, C. Wenk

    Research output: Contribution to journalArticleAcademicpeer-review

    31 Citations (Scopus)

    Abstract

    We present the first polynomial-time algorithm for computing the Fréchet distance for a non-trivial class of surfaces: simple polygons, i.e., the area enclosed by closed simple polygonal curves, which may lie in different planes. For this, we show that we can restrict the set of maps realizing the Fréchet distance, and develop an algorithm for computing the Fréchet distance using the algorithm for curves, techniques for computing shortest paths in a simple polygon, and dynamic programming.
    Original languageEnglish
    Pages (from-to)2-20
    JournalComputational Geometry
    Volume41
    Issue number1-2
    DOIs
    Publication statusPublished - 2008

    Fingerprint Dive into the research topics of 'Computing the Fréchet distance between simple polygons'. Together they form a unique fingerprint.

  • Cite this