Improved approximation bounds for planar point pattern matching

Lecture Notes in Computer Science

Volumn 3608, Issue , 2005, Pages 432-443

  Cho, Minkyoung ^a   Mount, David M ^a  

^a Institute of Advanced Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; PROBLEM SOLVING; SET THEORY;

APPROXIMATION BOUNDS; HAUSDROFF DISTANCE; PLANAR POINT SETS;

PATTERN MATCHING;

EID: 26844451816     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11534273_38     Document Type: Conference Paper

References (14)

1. [AAR94] H. Alt, O. Aichholzer, and G. Rote. Matching shapes with a reference point. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 85-92, 1994.
2. [AG96] H. Alt and L. J. Guibas. Discrete geometric shapes: Matching, interpolation, and approximation. Technical Report 96-11, Institut für Informatik, Freie Unversität Berlin, Berlin, Germany, 1996.
3. [ASG02] M. Alzina, W. Szpankowski, and A. Grama. 2d-pattern matching image and video compression: Theory, algorithms, and experiments. IEEE Trans. on Image Processing, 11:318-331, 2002.
4. +97] L. P. Chew, M. T. Goodrich, D. P. Huttenlocher, K. Kedem, J. M. Kleinberg, and D. Kravets. Geometric pattern matching under Euclidean motion. Comput. Geom. Theory Appl., 7:113-124, 1997.
5. [CS98] D. E. Cardoze and L. Schulman. Pattern matching for spatial point sets. In Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci., pages 156-165, 1998.
6. [dBvKOS00] M. de Berg, M. van Kreveld, M. H. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2nd edition, 2000.
7. +97] P. Finn, L. E. Kavraki, J. C. Latombe, R. Motwani, C. Shelton, S. Venkatasubramanian, and A. Yao. Rapid: Randomized pharmacophore identification for drug design. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 324-333, 1997.
8. [GMO94] M. T. Goodrich, J. S. Mitchell, and M. W. Orletsky. Practical methods for approximate geometric pattern matching under rigid motion. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 103-112, 1994.
9. [HHW92] J. E. Hopcroft, D. P. Huttenlocher, and P. C. Wayner. Affine invariants for model-based recognition. MIT Press, Cambridge, 1992.
10. [HKS93] D. P. Huttenlocher, K. Kedem, and M. Sharir. The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom., 9:267-291, 1993.
11. [HS94] P. J. Heffernan and S. Schirra. Approximate decision algorithms for point set congruence. Comput. Geom. Theory Appl., 4:137-156, 1994.
12. [IMV99] P. Indyk, R. Motwani, and S. Venkatasubramanian. Geometric matching under noise: Combinatorial bounds and algorithms. In Proc. 8th Annual ACM-SIAM on Discrete Algorithm, pages 457-465, 1999.
13. [MNM99] D. M. Mount, N. S. Netanyahu, and J. Le Moigne. Efficient algorithms for robust point pattern matching. Pattern Recognition, 32:17-38, 1999.
14. [Vel01] R. C. Veltkamp. Shape matching: Similarity measures and algorithms. Technical Report UU-CS 2001-03, Utrecht University: Information and Computing Sciences, Utrecht, The Netherlands, 2001.