## Abstract

The Fréchet distance is a well-studied measure for the similarity of shapes. While efficient algorithms for computing the Fréchet distance between curves exist, there are only few results on the Fréchet distance between surfaces. Recent work has shown that the Fréchet distance is computable between piecewise linear functions f and g : M → Rk with M a triangulated surface of genus zero. We focus on the case k = 1 and M being a topological sphere or disk with constant boundary. Intuitively, we measure the distance between terrains based solely on the height function. Our main result is that in this case computing the Fréchet distance between f and g is in NP. We additionally show that already for k = 1, computing a factor 2 - ϵ approximation of the Fréchet distance is NP-hard, showing that this problem is in fact NP-complete. We also define an intermediate distance, between contour trees, which we also show to be NP-complete to compute. Finally, we discuss how our and other distance measures between contour trees relate to each other.

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

Title of host publication | Proc. 28th Annual Symposium on Discrete Algorithms (SODA) |

Editors | P.N. Klein |

Place of Publication | Philadelphia |

Publisher | Association for Computing Machinery, Inc |

Pages | 2443-2455 |

Number of pages | 13 |

ISBN (Electronic) | 978-1-61197-478-2 |

DOIs | |

Publication status | Published - 2017 |

Event | 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017) - Barcelona, Spain Duration: 16 Jan 2017 → 19 Jan 2017 Conference number: 28 |

### Conference

Conference | 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017) |
---|---|

Abbreviated title | SODA 2017 |

Country/Territory | Spain |

City | Barcelona |

Period | 16/01/17 → 19/01/17 |