Finding a curve in a map

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

doi:10.1145/777847.777855

Finding a curve in a map

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

Computer Science

Research output: Contribution to conference › Paper › peer-review

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 language	English (US)
Pages	384-385
Number of pages	2
DOIs	https://doi.org/10.1145/777847.777855
State	Published - 2003
Event	Nineteenth Annual Symposium on Computational Geometry - san Diego, CA, United States Duration: Jun 8 2003 → Jun 10 2003

Other

Other	Nineteenth Annual Symposium on Computational Geometry
Country/Territory	United States
City	san Diego, CA
Period	6/8/03 → 6/10/03

Keywords

Fréchet distance
Shape matching

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Computational Mathematics

Access to Document

10.1145/777847.777855

Cite this

@conference{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",

doi = "10.1145/777847.777855",

language = "English (US)",

pages = "384--385",

note = "Nineteenth Annual Symposium on Computational Geometry ; Conference date: 08-06-2003 Through 10-06-2003",

}

TY - CONF

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

U2 - 10.1145/777847.777855

DO - 10.1145/777847.777855

M3 - Paper

AN - SCOPUS:0038714736

SP - 384

EP - 385

T2 - Nineteenth Annual Symposium on Computational Geometry

Y2 - 8 June 2003 through 10 June 2003

ER -

Finding a curve in a map

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this