Matching shapes with A reference point

International Journal of Computational Geometry and Applications

Volumn 7, Issue 4, 1997, Pages 349-363

  Aichholzer, Oswin ^a   Alt, Helmut ^b   Rote, Güter ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximation algorithms; Hausdorff distance; Pattern matching; Selectors; Steiner point

Indexed keywords

EID: 0031534208     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195997000211     Document Type: Article

References (17)

1. H. Alt, O. Aichholzer, G. Rote, Matching shapes with a reference point, Proceedings of the Tenth Annual Symposium on Computational Geometry, Stony Brook, New York, June 6-8, 1994; Association for Computing Machinery, pp. 85-92.
2. H. Alt, B. Behrends, J. Blömer, Approximate matching of polygonal shapes, Proceedings 7th Annual Symposium on Computational Geometry, 1991, 186-193. Final version in Annals of Mathematics and Artificial Intelligence 13 (1995), 251-265.
3. H. Alt, B. Behrends, J. Blömer, Approximate matching of polygonal shapes, Proceedings 7th Annual Symposium on Computational Geometry, 1991, 186-193. Final version in Annals of Mathematics and Artificial Intelligence 13 (1995), 251-265.
4. H. Alt, M. Godau, Computing the Hausdorff-distance in Higher Dimensions, in preparation.
5. P. J. Agarwal, M. Sharir, S. Toledo, Applications of parametric searching in geometric optimization, Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms, 1992, 72-82.
6. B. Behrends, Algorithmen zur Erkennung der ε-Kongruenz von Punktmengen und Polygonen, Diplomarbeit, FB Mathematik, Freie Universität Berlin, 1990.
7. P. P. Chew, M. T. Goodrich, D. P. Huttenlocher, K. Kedem, J. M. Kleinberg, D. Kravets, Geometric pattern matching under Euclidean motion, Proc. Fifth Canadian Conference on Computational Geometry, University of Waterloo, Ontario, 1993, pp. 151-156.
8. I. K. Daugavet, Some applications of the generalized Marcinkiewicz-Berman identity (Russian), Vestnik Leningrad. Univ. Mat. Mekh. Astronom. 19 (1968), 59-64.
9. B. Grünbaum, Convex Polytopes, Wiley & Sons, 1967.
10. D. P. Huttenlocher, K. Kedem, Computing the Minimum Hausdorff distance for point sets under translation, Proc. 6th Annual Symp. on Computational Geometry, 1990, 340-349.
11. D. P. Huttenlocher, G. A. Klauderman, W. J. Rucklidge, Comparing images using the Hausdorff-distance, IEEE Transactions on Pattern Analysis and Machine Intelligence 15 (1993), 850-863.
12. E. Michael, Continuous selections I, Ann. of Math. (2) 63 (1956), 361-382.
13. K. Przeslawski, Linear and Lipschitz-continuous selectors for the family of convex sets in Euclidean vector spaces, Bull. Pol. Acad. Sci. 33 (1985), 31-33.
14. K. Przeslawski, D. Yost, Continuity Properties of Selectors and Michael's Theorem, Michigan Math. J. 36 (1989), 113-134.
15. D. Rutovitz, Some Parameters Associated with a Finite Dimensional Banach space, J. London Math. Soc. 2 (1965), 241-255.
16. G. C. Shephard, The Steiner point of a convex polytope, Canadian J. Math. 18 (1966), 1294-1300.
17. R. Schneider, Krümmungsschwerpunkte konvexer Körper, Abh. Math. Sem. Hamburg 37 (1972), 112-132.