No-three-in-line for seventeen and nineteen
Discrete Mathematics - Proceedings of the Oberwolfach Meeting "Kombinatorik," January 19-25, 1986
Combinatorial complexity bounds for arrangements of curves and spheres
Discrete & Computational Geometry - Special issue on the complexity of arrangements
A guided tour of Chernoff bounds
Information Processing Letters
Implicitly representing arrangements of lines or segments
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Progress in the no-three-in-line problem
Journal of Combinatorial Theory Series A
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Clique partitions, graph compression and speeding-up algorithms
Journal of Computer and System Sciences
Extremal problems in combinatorial geometry
Handbook of combinatorics (vol. 1)
The exact fitting problem in higher dimensions
Computational Geometry: Theory and Applications
Progress in the no-three-in-line problem, II
Journal of Combinatorial Theory Series A
Norm-graphs: variations and applications
Journal of Combinatorial Theory Series B
Space-Time Tradeoffs for Emptiness Queries
SIAM Journal on Computing
Incidences of not-too-degenerate hyperplanes
SCG '05 Proceedings of the twenty-first 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 a question of bourgain about geometric incidences
Combinatorics, Probability and Computing
No l Grid-Points in Spaces of Small Dimension
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
| Hi-index | 0.00 |
In this paper we discuss three closely related problems on the incidence structure between n points and m hyperplanes in d-dimensional space: the maximal number of incidences if there are no big bipartite subconfigurations, a compressed representation for the incidence structure, and a lower bound for any algorithm that determines the number of incidences (counting version of Hopcroft's problem). For this we give a construction of a special point-hyperplane configuration, giving a lower bound, which almost meets the best upper bound known thus far.