Helmut Alt, Alon Efrat, Günter Rote, and Carola Wenk:

1. Matching planar maps

In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, January 12–14, 2003, pp. 589–598.

2. Matching planar maps

Journal of Algorithms 49 (2003), 262–283. doi:10.1016/S0196-6774(03)00085-3


We generalize the notion of the Fréchet distance from two curves to a curve and a graph and to two graphs, and we give efficient algorithms for computing the Fréchet distance in these cases.
  PostScript file (gzipped)

3. Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, and Günter Rote:

Finding a curve in a map (Video)

in: Video and Multimedia Review of Computational Geometry, Proceedings of the Nineteenth Annual Symposium on Computational Geometry, San Diego, June 8–10, 2003. Association for Computing Machinery, 2003, pp. 384–385. doi:10.1145/777792.777855
  free PDF @ACM
other papers about this subject
Last update: August 14, 2017.