On finding maximum-cardinality symmetric subsets

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

Volumn 2098, Issue , 2001, Pages 106-112

  Brass, Peter ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY;

CARDINALITIES; SYMMETRIC SUB-SET; THREE DIMENSIONAL SPACE;

SET THEORY;

EID: 84974685667     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47738-1_8     Document Type: Conference Paper

References (17)

1. 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
2. Alt, H, Mehlhorn, K., Wagener, H, Welzl, E.: Congruence, similarity, and symmetries of geometric objects. Discrete Comput. Geom. 3 (1988) 237-256
3. Alt, H., Guibas, L.: Resemblance of geometric objects. In J.-R. Sack, J. Urrutia (Eds.): Handbook of Computational Geometry Elsevier 1999, 121-153
4. Atallah, M.J.: On symmetry detection. IEEE Trans. Comput. 34 (1985) 663-666
5. Boxer, L., Miller, R.: Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices. Pattern Recog. Letters 14 (1993) 14-20
6. Brafl, P.: Exact point pattern matching and the number of congruent triangles. Algorithms — ESA 2000 (Mike Paterson, Ed.) LNCS 1879, 112-119
7. Brafl, P., Knauer, C: Testing the congruence of d-dimensional point sets. ACM Symposium on Comput. Geom. 2000, 310-314
8. Eades, P.: Symmetry finding algorithms. In: Computational Morphology. A computational geometric approach to the analysis of form. (Toussaint, Godfried T., Ed.) Machine Intelligence and Pattern Recognition Series 6 (1988) North-Holland, 41-51
9. Eades, P., Ng, H.C.: An algorithm for detecting symmetries in drawings. Ars Comb. 23A (1987) 95-104
10. Elekes, G., Erdos, P.: Similar configurations and pseudo grids. In: Intuitive geometry 1991 (K. Boroczky et al, Eds.) North-Holland, Colloq. Math. Soc. Janos Bolyai. 63 (1994) 85-104
11. Highnam, P.T.: Optimal algorithms for finding the symmetries of a planar point set. Inf. Proc. Letters 22 (1986) 219-222
12. Iwanowski, S.: Testing approximate symmetry in the plane is NP-hard. Theor. Comput. Sci. 80 (1991) 227-262
13. Kahng, A.B., Robins, G.: Optimal algorithms for extracting spatial regularity in images. Inf. Proc. Letters 12 (1991) 757-764
14. Laezkovich, M., Ruzsa, I.Z.: The number of homothetic subsets. In: The mathematics of Paul Erdos. Vol. 2. (R.L. Graham, et al, Eds.) Springer, Algorithms Comb. 14 (1997) 294-302
15. Pach, J., Agarwal, P.K.: Combinatorial Geometry. Wiley, New York 1995
16. Pach, J., Tardos, G.: personal communication
17. Robins, G., Robinson, B.L., Sethi, B.S.: On detecting spatial regularity in noisy images. Inf. Proc. Letters 69 (1999) 189-195