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

State | Published - Jul 28 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 | 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

## Fingerprint Dive into the research topics of 'Finding a curve in a map'. Together they form a unique fingerprint.

## Cite this

Wenk, C., Alt, H., Efrat, A., Palaniappan, L., & Rote, G. (2003).

*Finding a curve in a map*. 384-385. Paper presented at Nineteenth Annual Symposium on Computational Geometry, san Diego, CA, United States.