Abstract
We show that the Fréchet distance between two piecewise linear surfaces can be decided in finite time, hence, the problem is decidable. For the special case that one of the surfaces is a triangle, we show that the problem is in PSPACE. In both cases, our computational model is a Turing Machine, and our algorithms rely on Canny's result [STOC 1988] that the existential theory of the real numbers is decidable in PSPACE.
Cite
CITATION STYLE
Nayyeri, A., & Xu, H. (2018). On the decidability of the Fréchet distance between surfaces. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1109–1120). Association for Computing Machinery. https://doi.org/10.1137/1.9781611975031.72
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
