Problems and results on geometric patterns

Graph Theory and Combinatorial Optimization

Volumn , Issue , 2005, Pages 17-36

  Brass, Peter ^a   Pach, János ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750268224     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/0-387-25592-3_2     Document Type: Chapter

References (49)

1. hLbrego, B.M. and Fernbndez-Merchant, S. (2000). On the maximum number of equilateral triangles. I. Discrete and Computational Geometry, 23:l29-135.
2. hLbrego, B.M. and Fernbndez-Merchant S. (2002). Convex polyhedra in R3 spanning R(n4/7 congruent triangles, Journal of Combinatorial Theory. Series A, 98:406-409.
3. Agarwal, P.K. and Sharir, M. (2002). On the number of congruent simplices in a point set. Discrete and Computational Geometry, 28:123-150.
4. Akutsu, T., Tamaki, H., and Tokuyama, T. (1998). Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets. Discrete and Computational Geometry, 20:307-331.
5. Aronov, B., Pach, J., Sharir, M., and Tardos, G. (2003). Distinct distances in three and higher dimensions. In: 35th ACM Symposium on Theory of Computing, pp. 541-546.
6. Also in: Combinatorics, Probability and Computing, l3:283-293.
7. Beck, J . (1983). On the lattice property of the plane and some problems of Dirac, Motzkin and Erdos in combinatorial geometry. Combinatorica, 3:281-297.
8. Beck, J. and Spencer, J . (1984). Unit distances. Journal of Combinatorial Theory. Series A, 3:231-238.
9. Brass, P. (1997). On the maximum number of unit distances among n points in dimension four. In: I. BBrBny et al. (eds.), Intuitive Geometry, pp. 277-290 Bolyai Society Mathematical Studies, vol. 4.
10. Note also the correction of one case by K. Swanepoel in the review MR 98j:52030.
11. Brass, P. (2000). Exact point pattern matching and the number of congruent triangles in a three-dimensional pointset, In: M. Paterson (ed.), Algorithms-ESA 2000, pp. 112-119. Lecture Notes in Computer Science, vol. 1879, Springer-Verlag.
12. Brass , P. (2002). Combinatorial geometry problems in pattern recognition. Discrete and Computational Geometry, 28:495-510.
13. Burton, G.R. and Purdy, G.B. (1979). The directions determined by n points in the plane. Journal of the London Mathematical Society, 2O:lOg-114.
14. Cantwell, K. (1996). Finite Euclidean Ramsey theory. Journal of Combinatorial Theory. Series A, 73:273-285.
15. Chung, F.R.K. (1984). The number of different distances determined by n points in the plane. Journal of Combinatorial Theory. Series A, 36:342-354.
16. Chung, F.R.K., Szemerkdi, E., and Trotter, W.T. (1992) The number of different distances determined by a set of points in the Euclidean plane. Discrete and Computational Geometry, 7:l-11.
17. Clarkson, K.L., Edelsbrunner, H., Guibas, L., Sharir, M., and Welzl, E. (1990). Combinatorial complexity bounds for arrangements of curves and spheres. Discrete and Computational Geometry, 5:99-160.
18. Elekes, G. and Erdos, P. (1994). Similar configurations and pseudo grids. In: K. Boroczky et. al. (eds.), Intuitive Geometry, pp. 85-104. Colloquia Mathematica Societatis JBnos Bolyai, vol. 63.
19. Erdos, P. (1946). On sets of distances of n points. American Mathematical Monthly, 53:248-250.
20. Erdos, P. (1960). On sets of distances of n points in Euclidean space. Magyar Tudoma'nyos Akade'mia Matematikai Kutatd Inte'zet Kozleme'nyei 5:l65-169.
21. Erdos, P., Graham, R.L., Montgomery, P., Rothschild, B.L., Spencer, J., and Straus, E.G. (1973). Euclidean Ramsey theorems. I. Journal of Combinatorial Theory, Series A, 14:341-363.
22. Erdos, P., Graham, R.L., Montgomery, P. Rothschild, B.L., Spencer, J., and Straus, E.G. (1975). Euclidean Ramsey theorems. 111. In: A. Hajnal, R. Rado, and V.T. S6s (eds.), Infinite and Finite Sets, pp. 559-584. North-Holland, Amsterdam.
23. Erdos, P., Hickerson, D., and Pach, J . (1989). A problem of Leo Moser about repeated distances on the sphere, American Mathematical Monthly, 96:569-575.
24. Erdos, P. and Purdy, G. (1971). Some extremal problems in geometry, Journal of Combinatorial Theory, Series A, lO:246-252.
25. Erdos, P.and Purdy, G. (1977). Some extremal problems in geometry. V, In; Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 569-578. Congressus Numerantium, vol. 19.
26. Frankl, P. and Rodl, V. (1986). All triangles are Ramsey. Transactions of the American Mathematical Society, 297:777-779.
27. Hadwiger, H. (1961). Ungeloste Probleme No. 40. Elemente der Mathematik, 16:103-104.
28. Hales, A. W. and Jewett , R.I. (1963). Regularity and positional games. Transactions of the American Mathematical Society, 106:222-229.
29. J6zsa, S. and Szemerkdi, E. (1975). The number of unit distances in the plane. In: A. Hajnal et al. (eds.), Infinite and Finite Sets, Vol. 2, pp. 939-950. Colloquia Mathematica Societatis JBnos Bolyai vol. 10, North Holland.
30. Katz, N.H. and Tardos, G. (2004). Note on distinct sums and distinct distances. In: J. Pach (ed.), Towards a Theory of Geometric Graphs, pp. 119-126. Contemporary Mathematics, vo1.342, American Mathematical Society, Providence, RI.
31. van Kreveld, M. J. and de Berg, M.T. (1989). Finding squares and rectangles in sets of points. In: M. Nag1 (ed.), Graph-Theoretic Concepts in Computer Science, pp. 341-355. Lecture Notes in Computer Science, vol. 41 1, Springer-Verlag.
32. KPii, I. (1992). All trapezoids are Ramsey. Discrete Mathematics, lO8:59-62.
33. Laczkovich, M. and Ruzsa, I.Z. (1997). The number of homothetic subsets, In: R.L. Graham et al. (eds.), The Mathematics of Paul Erd6s. Vol. 11, pp. 294-302. Algorithms and Combinatorics, vol. 14, Springer-Verlag.
34. MatouSek, J. (1993). Range searching with efficient hierarchical cuttings. Discrete and Computational Geometry, lO:l57-182.
35. Moser, L. (1952). On different distances determined by n points. American Mathematical Monthly , 59235-91.
36. Pach, J. and Agarwal, P.K. (1995). Combinatorial Geometry. Wiley, New York.
37. Pach, J. and Sharir, M. (1992). Repeated angles in the plane and related problems. Journal of Combinatorial Theory. Series A, 59:l2-22.
38. Pach, J. and Sharir, M. (2004). Incidences. In: J. Pach (ed.), Towards a Theory of Geometric Graphs, pp. 283-293. Contemporary Mathematics, vol. 342, American Mathematical Society, Providence, RI.
39. Rado, R. (1943). Note on combinatorial analysis. Proceedings of the London Mathematical Society, 48:122-160.
40. de Rezende, P.J. and Lee, D.T. (1995). Point set pattern matching in d-dimensions. Algorithmica, l3:387-404.
41. Solymosi, J. and T6th, C.D. (2001). Distinct distances in the plane. Discrete and Computational Geometry, 25:629-634.
42. Solymosi, J. and Vu, V. (2005). Near optimal bounds for the number of distinct distances in high dimensions. Forthcoming in Combinatorica.
43. Spencer, J., Szemer6di, E., and Trotter, W.T. (1984). Unit distances in the Euclidean plane. In: B. Bollobds (ed.), Graph Theory and Combinatorics, pp. 293-304. Academic Press, London, 1984
44. Straus, E.G. (1978). Some extremal problems in combinatorial geometry. In: Combinatorial Mathematics, pp. 308-312. Lecture Notes in Mathematics, vol. 686.
45. Szhkely, L.A. (1997). Crossing numbers and hard Erdos problems in discrete geometry. Combinatorics, Probability and Computing, 6:353-358.
46. Tardos, G. (2003). On distinct sums and distinct distances. Advances in Mathematics, 180:275-289.
47. Ungar, P. (1982). 2N noncollinear points determine at least 2N directions. Journal of Combinatorial Theory. Series A, 33:343-347.
48. van Warnelen, P. (1999). The maximum number of unit distances among n points in dimension four. Beitrage Algebra Geometrie, 40:475-477.
49. Witt, E. (1952). Ein kombinatorischer Satz der Elementargeometrie. Mathematische Nachrichten, 6:261-262.