We show that it is NP-hard to decide the Fréchet distance between (i) non-intersecting polygons with holes embedded in the plane, (ii) 2d terrains, and (iii) self-intersecting simple polygons in 2d, which can be unfolded in 3d. The only previously known NP-hardness result for 2d surfaces was based on self-intersecting polygons with an unfolding in 4d. In contrast to this old result, our NP-hardness reductions are substantially simpler. As a positive result we show that the Fréchet distance between polygons with one hole can be computed in polynomial time. © 2010 Springer-Verlag.
CITATION STYLE
Buchin, K., Buchin, M., & Schulz, A. (2010). Fréchet distance of surfaces: Some simple hard cases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6347 LNCS, pp. 63–74). Springer Verlag. https://doi.org/10.1007/978-3-642-15781-3_6
Mendeley helps you to discover research relevant for your work.