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 Citation (Scopus)

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
StatePublished - 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

OpenGL
Curve
Graphical User Interface
Efficient Algorithms
Graphical user interfaces
Path
Graph in graph theory

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)

Finding a curve in a map. / Wenk, Carola; Alt, Helmut; Efrat, Alon; Palaniappan, Lingeshwaran; Rote, Günter.

Proceedings of the Annual Symposium on Computational Geometry. 2003. p. 384-385.

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

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, Nineteenth Annual Symposium on Computational Geometry, san Diego, CA, United States, 6/8/03.
Wenk C, Alt H, Efrat A, Palaniappan L, Rote G. Finding a curve in a map. In Proceedings of the Annual Symposium on Computational Geometry. 2003. p. 384-385
Wenk, Carola ; Alt, Helmut ; Efrat, Alon ; Palaniappan, Lingeshwaran ; Rote, Günter. / Finding a curve in a map. Proceedings of the Annual Symposium on Computational Geometry. 2003. pp. 384-385
@inproceedings{d5c23f07f81e4b7590d0b4b133e895b3,
title = "Finding a curve in a map",
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.",
keywords = "Fr{\'e}chet distance, Shape matching",
author = "Carola Wenk and Helmut Alt and Alon Efrat and Lingeshwaran Palaniappan and G{\"u}nter Rote",
year = "2003",
language = "English (US)",
pages = "384--385",
booktitle = "Proceedings of the Annual Symposium on Computational Geometry",

}

TY - GEN

T1 - Finding a curve in a map

AU - Wenk, Carola

AU - Alt, Helmut

AU - Efrat, Alon

AU - Palaniappan, Lingeshwaran

AU - Rote, Günter

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - Fréchet distance

KW - Shape matching

UR - http://www.scopus.com/inward/record.url?scp=0038714736&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038714736&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0038714736

SP - 384

EP - 385

BT - Proceedings of the Annual Symposium on Computational Geometry

ER -