Computing the Fréchet distance between folded polygons

Atlas F. Cook IV, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk

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


Computing the Fréchet distance for surfaces is a surprisingly hard problem and the only known algorithm is limited to computing it between flat surfaces. We adapt this algorithm to create one for computing the Fréchet distance for a class of non-flat surfaces which we call folded polygons. Unfortunately, the original algorithm cannot be extended directly. We present three different methods to adapt it. The first of which is a fixed-parameter tractable algorithm. The second is a polynomial-time approximation algorithm. Finally, we present a restricted class of folded polygons for which we can compute the Fréchet distance in polynomial time.

Original languageEnglish (US)
Title of host publicationAlgorithms and Data Structures - 12th International Symposium, WADS 2011, Proceedings
Number of pages12
StatePublished - 2011
Event12th International Symposium on Algorithms and Data Structures, WADS 2011 - New York, NY, United States
Duration: Aug 15 2011Aug 17 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6844 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other12th International Symposium on Algorithms and Data Structures, WADS 2011
Country/TerritoryUnited States
CityNew York, NY


  • Computational Geometry
  • Fréchet Distance
  • Shape Matching

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


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

Cite this