A linear time algorithm for the computation of some distance functions between convex polygons
M. J. Atallah; C. C. Ribeiro; S. Lifschitz
RAIRO - Operations Research - Recherche Opérationnelle (1991)
- Volume: 25, Issue: 4, page 413-424
- ISSN: 0399-0559
Access Full Article
topHow to cite
topReferences
top- 1. M. J. ATALLAH, A Linear Time Algorithm for the Hausdorff Distance between Convex Polygons, Inform. Process. Lett., 1983, 17, pp. 207-209. Zbl0527.68051MR742070
- 2. P. Cox, H. MAITRE, and M. MINOUX and C. C. RIBEIRO, Optimal Matching of Convex Polygons, Pattern Recognition Lett., 1989, 9, pp.327-334. Zbl0800.68758
- 3. H. EDELSBRUNNER, Computing the Extreme Distances between Two Convex Polygons, J. Algorithms, 1985, 6, pp. 213-224. Zbl0604.68079MR789904
- 4. B. GRUNBAUM, 1967Convex Polytopes, Wiley, New York. Zbl0163.16603MR226496
- 5. J. O'ROURKE, C.-B. CHIEN, T. OLSON and D. NADDOR, A New Linear Time Algorithm for Intersecting Convex Polygons, Comput. Graph. Image Process., 1982, 19, pp. 384-391. Zbl0533.52001