Exact point pattern matching and the number of congruent triangles in a three-dimensional pointset

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1879, Issue , 2000, Pages 112-119

  Brass, Peter ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING; GEOMETRY;

EUCLIDEAN SPACES; LOWER BOUNDS; NUMBER OF TRIANGLES; POINT PATTERN MATCHING; POINT SET; THREE DIMENSIONAL SPACE; UPPER BOUND;

GEOMETRY; ALGORITHMS;

EID: 84867991531     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45253-2_11     Document Type: Article

References (23)

1. Agarwal, P.K., Aronov, B., Sharir, M., Suri, S.: Selecting distances in the plane. Algorithmica 9 (1993) 495-514
2. Akutsu, T., Tamaki, H., Tokuyama, T.: Distribution of distances and triangles in a point set and algorithms for computing the largest common point set. Discrete Comput. Geom. 20 (1998) 307-331
3. Alt, H., Mehlhorn, K., Wagener, H., Welzl, E.: Congruence, similarity, and symmetries of geometric objects. Discrete Comput. Geom. 3 (1988) 237-256
4. Alt, H., Guibas, L.: Resemblance of geometric objects. In J. R. Sack, J. Urrutia (Eds.): Handbook of Computational Geometry Elsevier 1999, 121-153
5. Atallah, M.J.: On symmetry detection. IEEE Trans. Comput. 34 (1985) 663-666
6. Atkinson, M.D.: An optimal algorithm for geometrical congruence. J. Algorithms 8 (1987) 159-172
7. Boxer, L.: Point set pattern matching in 3-D. Pattern Recog. Letters 17 (1996) 1293-1297
8. Boxer, L.: Faster point set pattern matching in 3-D. Pattern Recog. Letters 19 (1998) 1235-1240
9. Braß, P., Knauer, C.: Testing the congruence of d-dimensional point sets. To appear in ACM Symposium on Comput. Geom. 2000
10. Chan, T.M.: On enumerating and selecting distances. ACM Symposium on Comput. Geom. 1998, 279-286
11. Chapman, C.R.: News and Reviews. The Planetary Report 19 No. 5 (1999), p.18
12. Chazelle, B., Edelsbrunner, H., Guibas, L.J., Sharir, M.: A singly-exponential stratification scheme for real semi-algebraic varieties and its applications. Theoretical Comput. Sci. 84 (1991) 77-105
13. Clarkson, K., Edelsbrunner, H., Guibas, L.J., Sharir, M., Welzl, E.: Combinatorial complexity bounds for arrangements of curves and spheres. Discrete Comput. Geom. 5 (1990) 99-160
14. Erdos, P., Hickerson, D., Pach, J.: A problem of Leo Moser about repeated distances on the sphere. Amer. Math. Mon. 96 (1989) 569-575
15. Erdos, P., Purdy, G.: Some extremal problems in geometry. J. Comb. Theory 10 (1971) 246-252
16. Erdos, P., Purdy, G.: Some extremal problems in geometry IV. Proc. 7th SouthEastern Conf. Combinatorics, Graph Theory, and Computing 1976, 307-322
17. Highnam, P.T.: Optimal algorithms for finding the symmetries of a planar point set. Inf. Proc. Letters 22 (1986) 219-222
18. Huttenlocher, D.P., Kedem, K., Kleinberg, J.M.: On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane. Proc. 8th Annual ACM Symposium Comput. Geom. (1992) 110-120
19. Kõvári, T., Turán, P., Sós, V.T.: On a problem of K. Zarankiewicz Colloq. Math. 3 (1954) 50-57
20. Manacher, G.K.: An application of pattern matching to a problem in geometrical complexity. Inf. Proc. Letters 5 (1976) 6-7
21. de Rezende, P.J., Lee, D.T.: Point set pattern matching in d-dimensions. Algorith-mica 13 (1995) 387-404
22. Sugihara, K.: An nlogn algorithm for determining the congruity of polyhedra. J. Comput. Syst. Sci. 29 (1984) 36-47
23. Weber, G., Knipping, L., Alt, H.: An Application of Point Pattern Matching in Astronautics. Journal of Symbolic Computation 17 (1994) 321-340