Finding a curve in a map

  • Authors:

  • Carola Wenk;Helmut Alt;Alon Efrat;Lingeshwaran Palaniappan;Gunter Rote

  • Affiliations:

  • University of Arizona, Tucson, AZ;Freie Universitat Berlin, Institut fur Informatik, Berlin, Germany;University of Arizona, Tucson, AZ;University of Arizona, Tucson, AZ;Freie Universitat Berlin, Institut fur Informatik, Berlin, Germany

  • Venue:
  • Proceedings of the nineteenth annual symposium on Computational geometry
  • Year:
  • 2003

  • Matching planar maps

    SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fréchet distance for curves.