Skip to main content
Article thumbnail
Location of Repository

Computing the Frechet Distance between . . .

By et al. Kevin Buchin

Abstract

We present the first polynomial-time algorithm for computing the Fréchet distance for a non-trivial class of surfaces: simple polygons. For this, we show that it suffices to consider homeomorphisms that map an arbitrary triangulation of one polygon to the other polygon such that diagonals of the triangulation are mapped to shortest paths in the other polygon

Topics: Fréchet Distance, Simple Polygons
Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.84
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.utsa.edu/~carola... (external link)
  • Suggested articles


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