Skip to main content
SpringerLink
Log in

Generalized approximate algorithms for point set congruence

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 709))

Included in the following conference series:

Abstract

We address the question of determining if two point sets are congruent. This task consists of defining the concept of point congruence, and developing algorithms that test for it. We introduce the (ε,κ)-map, a device which pictorially represents the degree of congruence between two point sets. Point set congruence has been studied by previous researchers, but we feel that our definitions offer a more general and powerful approach to the problem. By using the paradigm of approximate algorithms, we are able to construct the (ε,κ)-map efficiently.

Supported in part by the U.S. Army Research Office, Grant No. DAAL03-92-G-0378

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Alt, K. Mehlhorn, H. Wagener, and E. Welzl, “Congruence, similarity, and symmetries of geometric objects,” Discrete and Computational Geometry, 3 (1988), pp. 237–256.

    Google Scholar 

  2. E.M. Arkin, K. Kedem, J.S.B. Mitchell, J. Sprinzak, M. Werman, “Matching points into noise regions: combinatorial bounds and algorithms,” ORSA J. on Computing, 4 (1992), pp. 375–386.

    Google Scholar 

  3. H.S. Baird, Model-Based Image Matching Using Location, MIT Press, 1984.

    Google Scholar 

  4. T. Feder and R. Motwani, “Clique partitions, graph compression and speeding-up algorithms,” in Proc. of the 23rd ACM Symp. on Theory of Computing, 1991.

    Google Scholar 

  5. P.J. Heffernan and S. Schirra, “Approximate decision algorithms for point set congruence,” in Proc. of 8th ACM Symp. on Computational Geometry (1992), pp. 93–101; to appear in Computational Geometry: Theory and Applications.

    Google Scholar 

  6. G.E. Martin, Transformation Geometry, Springer Verlag, 1982.

    Google Scholar 

  7. K. Mehlhorn, Data Structures and Algorithms 2: Graph Algorithms and NP-completeness, Springer-Verlag, 1984.

    Google Scholar 

  8. F.P. Preparata and M.I. Shamos, Computational Geometry — An Introduction, Springer-Verlag, 1985.

    Google Scholar 

  9. S. Schirra, Über die Bitkomplexität der ε-Kongruenz, Diplomarbeit, Universität des Saarlandes, Saarbrücken, Germany, 1988.

    Google Scholar 

  10. S. Schirra, “Approximate decision algorithms for approximate congruence,” Information Processing Letters, 43 (1992), pp. 29–34.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematical Sciences, Memphis State University, 38152, Memphis, Tennessee

    Paul J. Heffernan

Authors
  1. Paul J. Heffernan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Jörg-Rüdiger Sack Nicola Santoro Sue Whitesides

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heffernan, P.J. (1993). Generalized approximate algorithms for point set congruence. In: Dehne, F., Sack, JR., Santoro, N., Whitesides, S. (eds) Algorithms and Data Structures. WADS 1993. Lecture Notes in Computer Science, vol 709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57155-8_263

Download citation

  • DOI: https://doi.org/10.1007/3-540-57155-8_263

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57155-1

  • Online ISBN: 978-3-540-47918-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation