Finding a curve in a map

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´echet distance for curves. Categories and Subject Descriptors F.2.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity—Geometrical problems and computations General Terms Algorithms Keywords Fr´echet distance, shape matching

• Type: Conference
• Year: 2003
• Where: COMPGEOM
• Authors: Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote
• Keywords: COMPGEOM 2003, Fr´echet Distance, Polygonal Curve, Well-known Fr´echet Distance