Complexity and Algorithms for the Discrete Fr\'echet Distance Upper Bound with Imprecise Input
Computational Geometry
2015-09-14 v2
Abstract
We study the problem of computing the upper bound of the discrete Fr\'{e}chet distance for imprecise input, and prove that the problem is NP-hard. This solves an open problem posed in 2010 by Ahn \emph{et al}. If shortcuts are allowed, we show that the upper bound of the discrete Fr\'{e}chet distance with shortcuts for imprecise input can be computed in polynomial time and we present several efficient algorithms.
Cite
@article{arxiv.1509.02576,
title = {Complexity and Algorithms for the Discrete Fr\'echet Distance Upper Bound with Imprecise Input},
author = {Chenglin Fan and Binhai Zhu},
journal= {arXiv preprint arXiv:1509.02576},
year = {2015}
}
Comments
15 pages, 8 figures