The complexity of cells in three-dimensional arrangements
Discrete Mathematics
The complexity of many cells in arrangements of planes and related problems
Discrete & Computational Geometry - Special issue on the complexity of arrangements
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Counting facets and incidences
Discrete & Computational Geometry
On joints in arrangements of lines in space and related problems
Journal of Combinatorial Theory Series A
Lectures on Discrete Geometry
On counting point-hyperplane incidences
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
On the Number of Incidences Between Points and Curves
Combinatorics, Probability and Computing
Crossing Numbers and Hard Erdös Problems in Discrete Geometry
Combinatorics, Probability and Computing
Lenses in arrangements of pseudo-circles and their applications
Journal of the ACM (JACM)
Point–Line Incidences in Space
Combinatorics, Probability and Computing
An Improved Bound for Joints in Arrangements of Lines in Space
Discrete & Computational Geometry
Incidences of not-too-degenerate hyperplanes
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Incidences in three dimensions and distinct distances in the plane
Proceedings of the twenty-sixth annual symposium on Computational geometry
On lines, joints, and incidences in three dimensions
Journal of Combinatorial Theory Series A
| Hi-index | 0.00 |
Given a set of s points and a set of n2 lines in three-dimensional Euclidean space such that each line is incident to n points but no n lines are coplanar, we show that s = Ω(n11/4). This is the first non-trivial answer to a question recently posed by Jean Bourgain.