The complexity of cells in three-dimensional arrangements
Discrete Mathematics
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Combinatorial complexity bounds for arrangements of curves and spheres
Discrete & Computational Geometry - Special issue on the complexity of arrangements
The complexity of many cells in arrangements of planes and related problems
Discrete & Computational Geometry - Special issue on the complexity of arrangements
Counting facets and incidences
Discrete & Computational Geometry
A Hyperplane Incidence Problem with Applications to Counting Distances
SIGAL '90 Proceedings of the International Symposium on Algorithms
On counting point-hyperplane incidences
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Crossing Numbers and Hard Erdös Problems in Discrete Geometry
Combinatorics, Probability and Computing
Cell Complexities in Hyperplane Arrangements
Discrete & Computational Geometry
Similar simplices in a d-dimensional point set
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
Combinatorics, Probability and Computing
On a question of bourgain about geometric incidences
Combinatorics, Probability and Computing
| Hi-index | 0.00 |
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.