Combinatorial complexity bounds for arrangements of curves and spheres
Discrete & Computational Geometry - Special issue on the complexity of arrangements
Repeated angles in the plane and related problems
Journal of Combinatorial Theory Series A
Combinatorial Geometry
Crossing Numbers and Hard Erdös Problems in Discrete Geometry
Combinatorics, Probability and Computing
New bounds on crossing numbers
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
On the distinct distances determined by a planar point set
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Incidences between points and circles in three and higher dimensions
Proceedings of the eighteenth annual symposium on Computational geometry
On the Combinatorics of Projective Mappings
Journal of Algebraic Combinatorics: An International Journal
Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Improved upper bounds on the crossing number
Proceedings of the twenty-fourth annual symposium on Computational geometry
On a question of bourgain about geometric incidences
Combinatorics, Probability and Computing
A bipartite strengthening of the Crossing Lemma
Journal of Combinatorial Theory Series B
A bipartite strengthening of the crossing lemma
GD'07 Proceedings of the 15th international conference on Graph drawing
| Hi-index | 0.00 |
We apply an idea of Székely to prove a general upper bound on the number of incidences between a set of m points and a set of n ‘well-behaved’ curves in the plane.