Abstract
We consider the well known problem of matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance. This is a well studied problem in computational geometry. Goodrich, Mitchell, and Orletsky [GMO94] presented a very simple approximation algorithm for this problem, which computes transformations based on aligning pairs of points. They showed that their algorithm achieves an approximation ratio of 4. We consider a minor modification to their algorithm, which is based on aligning midpoints rather than endpoints. We show that this algorithm achieves an approximation ratio not greater than 3.13. Our analysis is sensitive to the ratio between the diameter of the pattern set and the Hausdorff distance, and we show that the approximation ratio approaches 3 in the limit. Finally, we provide lower bounds that show that our approximation bounds are nearly tight.
This work was supported by the National Science Foundation under grant CCR-0098151.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alt, H., Aichholzer, O., Rote, G.: Matching shapes with a reference point. In: Proc. 10th Annu. ACM Sympos. Comput. Geom., pp. 85–92 (1994)
Alt, H., Guibas, L.J.: Discrete geometric shapes: Matching, interpolation, and approximation. Technical Report 96–11, Institut für Informatik, Freie Unversität Berlin, Berlin, Germany (1996)
Alzina, M., Szpankowski, W., Grama, A.: 2d-pattern matching image and video compression: Theory, algorithms, and experiments. IEEE Trans. on Image Processing 11, 318–331 (2002)
Chew, L.P., Goodrich, M.T., Huttenlocher, D.P., Kedem, K., Kleinberg, J.M., Kravets, D.: Geometric pattern matching under Euclidean motion. Comput. Geom. Theory Appl. 7, 113–124 (1997)
Cardoze, D.E., Schulman, L.: Pattern matching for spatial point sets. In: Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci., pp. 156–165 (1998)
de Berg, M., van Kreveld, M., Overmars, M.H., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Heidelberg (2000)
Finn, P., Kavraki, L.E., Latombe, J.C., Motwani, R., Shelton, C., Venkatasubramanian, S., Yao, A.: Rapid: Randomized pharmacophore identification for drug design. In: Proc. 13th Annu. ACM Sympos. Comput. Geom., pp. 324–333 (1997)
Goodrich, M.T., Mitchell, J.S., Orletsky, M.W.: Practical methods for approximate geometric pattern matching under rigid motion. In: Proc. 10th Annu. ACM Sympos. Comput. Geom., pp. 103–112 (1994)
Hopcroft, J.E., Huttenlocher, D.P., Wayner, P.C.: Affine invariants for model-based recognition. MIT Press, Cambridge (1992)
Huttenlocher, D.P., Kedem, K., Sharir, M.: The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom. 9, 267–291 (1993)
Heffernan, P.J., Schirra, S.: Approximate decision algorithms for point set congruence. Comput. Geom. Theory Appl. 4, 137–156 (1994)
Indyk, P., Motwani, R., Venkatasubramanian, S.: Geometric matching under noise: Combinatorial bounds and algorithms. In: Proc. 8th Annual ACM-SIAM on Discrete Algorithm, pp. 457–465 (1999)
Mount, D.M., Netanyahu, N.S., Le Moigne, J.: Efficient algorithms for robust point pattern matching. Pattern Recognition 32, 17–38 (1999)
Veltkamp, R.C.: Shape matching: Similarity measures and algorithms. Technical Report UU-CS 2001-03, Utrecht University: Information and Computing Sciences, Utrecht, The Netherlands (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cho, M., Mount, D.M. (2005). Improved Approximation Bounds for Planar Point Pattern Matching. In: Dehne, F., López-Ortiz, A., Sack, JR. (eds) Algorithms and Data Structures. WADS 2005. Lecture Notes in Computer Science, vol 3608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534273_38
Download citation
DOI: https://doi.org/10.1007/11534273_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28101-6
Online ISBN: 978-3-540-31711-1
eBook Packages: Computer ScienceComputer Science (R0)