György Elekes
ABSTRACT
We present a multi-dimensional generalization of the Szemerédi-Trotter Theorem, and give a sharp bound on the number of incidences of points and not-too-degenerate hyperplanes in three- or higher-dimensional Euclidean spaces. We call a hyperplane not-too-degenerate if at most a constant portion of its incident points lie in a lower dimensional affine subspace.
- Pankaj K. Agarwal and Boris Aronov, Counting facets and incidences, Discrete Comput. Geom. 7 (1992) 359--369.Google Scholar
Digital Library
- Boris Aronov and Micha Sharir, Cell complexities in hyperplane arrangements, Discrete Comput. Geom. 32 (2004), 107--115. Google ScholarDigital Library
- József Beck, On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős, Combinatorica 3 (3-4) (1983), 281--297.Google ScholarCross Ref
- Peter Braβ and Christian Knauer, On counting point-hyperplane incidences, Comput. Geom. Theory Appl. 25 (1-2) (2003), 13--20. Google ScholarDigital Library
- Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, and Emo Welzl, Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Comput. Geom. 5 (1990), 99--160.Google ScholarDigital Library
- Herbert Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, 1987. Google ScholarDigital Library
- Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, The complexity of many cells in arrangements of planes and related problems, Discrete Comput. Geom. 5 (1990), 197--216.Google ScholarDigital Library
- Herbert Edelsbrunner and David Haussler, The complexity of cells in three-dimensional arrangements, Discrete Math. 60 (1986), 139--146. Google ScholarDigital Library
- Herbert Edelsbrunner and Micha Sharir, A hyperplane incidence problem with applications to counting distances, in Proc. SIGAL International Symposium on Algorithms (T. Asano et al., eds.), vol. 450 of LNCS, Springer-Verlag, Berlin, 1990, pp. 419--428. Google ScholarDigital Library
- György Elekes, Sums versus products in Number Theory, Algebra and Erdős Geometry, vol 11 of Bolyai Soc. Math. Stud., János Bolyai Math. Soc., Budapest, 2002, pp. 241--290.Google Scholar
- Jeff Erickson, New lower bounds for Hopcroft's problem, Discrete Comput. Geom. 16 (1996), 389--418.Google ScholarDigital Library
- Sten Hansen, A generalization of a theorem of Sylvester on the lines determined by a finite point set, Math. Scand. 16 (1965) 175--180.Google ScholarCross Ref
- Theodore S. Motzkin, The lines and planes connecting the points of a finite set, Trans. Amer. Math. Soc. 70 (1951), 451--464.Google ScholarCross Ref
- János Pach and Micha Sharir, Geometric incidences, in Towards a Theory of Geometric Graphs (J. Pach, ed.), vol. 342 of Contemporary Mathematics, Amer. Math. Soc., Providence, RI, 2004, pp. 185--223.Google Scholar
- Endre Szemerédi and William T. Trotter Jr., Extremal problems in Discrete Geometry, Combinatorica 3 (3--4) (1983), 381--392.Google ScholarCross Ref
- László A. Székely, Crossing numbers and hard Erdő problems in discrete geometry, Combinatorics, Probability & Computing 6 (3) (1997), 353--358. Google ScholarDigital Library
- Csaba D. Tóth, Incidence problems in the Euclidean space, Masters Thesis (in Hungarian), Eötvös Lor&225;nd University, Budapest, 1997.Google Scholar
Index Terms
- Incidences of not-too-degenerate hyperplanes
Recommendations
Incidences between points and circles in three and higher dimensions
SCG '02: Proceedings of the eighteenth annual symposium on Computational geometry(MATH) We show that the number of incidences between m distinct points and n distinct circles in $\reals^3$ is O(m 4/7 n 17/21+m 2/3 n 2/3+m+n); the bound is optimal for m n 3/2. This result extends recent work on point-circle incidences in the plane, ...
Homotheties and incidences
AbstractWe consider problems involving rich homotheties in a set S of n points in the plane (that is, homotheties that map many points of S to other points of S). By reducing these problems to incidence problems involving points and lines in R ...
A Structural Szemerédi–Trotter Theorem for Cartesian Products
AbstractWe study configurations of n points and n lines that form incidences, when the point set is a Cartesian product. We prove structural properties of such configurations, such that there exist many families of parallel lines or many families ...
Comments