Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. A. Amir and M. Farach. Efficient 2-dimensional approximate matching of non-rectangular figures. In Proc. SODA’91, pages 212–223, San Francisco, CA, Jan 1991.
2. A. Amir and G. Landau. Fast parallel and serial multidimensional approximate array matching. Theoretical Computer Science, 81:97–115, 1991. Also as report CS-TR-2288, Dept. of Computer Science, Univ. of Maryland, 1989.
3. M. Atallah. A linear time algorithm for the Hausdorff distance between convex polygons, Information Processing Letters 17, 207–209, 1983.
4. Lect Notes Comput Sci;R. Baeza-Yates,1998
5. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, Oxford, UK, 1994.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献