Article thumbnail

Computing the Fréchet distance between folded polygons

By AF Atlas Cook, A Anne Driemel, J Sherette and C Wenk


Computing the Fréchet distance for surfaces is a surprisingly hard problem and the only known polynomial-time algorithm is limited to computing it between flat surfaces. We study the problem of computing the Fréchet distance for a class of non-flat surfaces called folded polygons. We present a fixed-parameter tractable algorithm for this problem. Next, we present a polynomial-time approximation algorithm. Finally, we present a restricted class of folded polygons for which we can compute the Fréchet distance for L_8 in polynomial time. Keywords: Fréchet distance; Surface comparison; Folded polygon

Publisher: 'Elsevier BV'
Year: 2015
OAI identifier:
Provided by: Repository TU/e
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.