Approximate decision algorithms for point set congruence

Computational Geometry: Theory and Applications

Volumn 4, Issue 3, 1994, Pages 137-156

  Heffernan, Paul J ^a   Schirra, Stefan ^b  

^a UNIVERSITY OF MEMPHIS   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Approximate decision algorithms; Computational geometry; Computer vision; Network flows; Point matching

Indexed keywords

EID: 0006106313     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(94)90004-3     Document Type: Article

References (26)

1. Network flows
2. Congruence similarity and symmetries of geometric objects
3. Matching points into pairwise-disjoint noise regions: combinatorial bounds and algorithms
4. Algorithms for generalized matching of point sets
5. Algorithmen zur Erkennung der ε-Kongruenz von Punktmengen
6. Improvements on geometric pattern matching problems
7. Clique partitions, graph compression and speeding-up algorithms
8. Network flow algorithms
9. A new approach to the maximum flow problem
10. The translation square map and approximate congruence
11. Efficiently computing the Hausdorff distance for point sets under translation
12. On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidian motion in the plane
13. The upper envelope of Voronoi-surfaces and its applications
14. Minimax geometric fitting of two corresponding sets of points
15. Approximate Congruence and Symmetry Detection in the Plane
16. An optimal construction method for generalized convex layers
17. Über die Bitkomplexität der ε-Kongruenz
18. Approximate decision algorithms for approximate congruence
19. An O(n log n) algorithm for maximum network flow
20. A data structure for dynamic trees
21. Data Structures and Network Algorithms