Finding a curve in a map

Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote

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

1 Scopus citations

Abstract

An efficient algorithm to find a path in the graph, which is most similar to the polygonal curve provided as input, was discussed. The algorithm is based upon the well-known Frechet distance for curves. The algorithm was implemented in C with a graphical user interface using OpenGL.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
Pages384-385
Number of pages2
Publication statusPublished - 2003
EventNineteenth Annual Symposium on Computational Geometry - san Diego, CA, United States
Duration: Jun 8 2003Jun 10 2003

Other

OtherNineteenth Annual Symposium on Computational Geometry
CountryUnited States
Citysan Diego, CA
Period6/8/036/10/03

    Fingerprint

Keywords

  • Fréchet distance
  • Shape matching

ASJC Scopus subject areas

  • Software
  • Geometry and Topology
  • Safety, Risk, Reliability and Quality
  • Chemical Health and Safety

Cite this

Wenk, C., Alt, H., Efrat, A., Palaniappan, L., & Rote, G. (2003). Finding a curve in a map. In Proceedings of the Annual Symposium on Computational Geometry (pp. 384-385)