Matching points into noise regions: combinatorial bounds and algorithms

Authors:
Esther M. Arkin;Klara Kedem;Joseph S. B. Mitchell;Josef Sprinzak;Michael Werman
Affiliations:
School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY;Department of Computer Science, Tel-Aviv University, Tel-Aviv, Israel;School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY;Department of Computer science, The Hebrew University, Jerusalem, Israel;Department of Computer science, The Hebrew University, Jerusalem, Israel
Venue:
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Year:
1991

Approximate matching of polygonal shapes (extended abstract)

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Approximate decision algorithms for point set congruence

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Improvements on bottleneck matching and related problems using geometry

Proceedings of the twelfth annual symposium on Computational geometry
Polynomial-Time Geometric Matching for Object Recognition

International Journal of Computer Vision
Noisy colored point set matching

Discrete Applied Mathematics
Matching points with things

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Approximate one-to-one point pattern matching

Journal of Discrete Algorithms
Non-crossing matchings of points with geometric objects

Computational Geometry: Theory and Applications

Hi-index	0.00