### Abstract

We present the first polynomial-time algorithm for computing the Fréchet distance for a non-trivial class of surfaces: simple polygons, i.e., the area enclosed by closed simple polygonal curves, which may lie in different planes. For this, we show that we can restrict the set of maps realizing the Fréchet distance, and develop an algorithm for computing the Fréchet distance using the algorithm for curves, techniques for computing shortest paths in a simple polygon, and dynamic programming.

Original language | English |
---|---|

Pages (from-to) | 2-20 |

Journal | Computational Geometry |

Volume | 41 |

Issue number | 1-2 |

DOIs | |

Publication status | Published - 2008 |

## Fingerprint Dive into the research topics of 'Computing the Fréchet distance between simple polygons'. Together they form a unique fingerprint.

## Cite this

Buchin, K., Buchin, M., & Wenk, C. (2008). Computing the Fréchet distance between simple polygons.

*Computational Geometry*,*41*(1-2), 2-20. https://doi.org/10.1016/j.comgeo.2007.08.003