Topological graphs with no self-intersecting cycle of length 4
Proceedings of the nineteenth annual symposium on Computational geometry
On the Complexity of Many Faces in Arrangements of Circles
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Lenses in arrangements of pseudo-circles and their applications
Journal of the ACM (JACM)
On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences
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 bichromatic k-set problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On levels in arrangements of curves, iii: further improvements
Proceedings of the twenty-fourth annual symposium on Computational geometry
Extremal problems on triangle areas in two and three dimensions
Proceedings of the twenty-fourth annual symposium on Computational geometry
Extremal problems on triangle areas in two and three dimensions
Journal of Combinatorial Theory Series A
Tangencies between families of disjoint regions in the plane
Proceedings of the twenty-sixth annual symposium on Computational geometry
On the bichromatic k-set problem
ACM Transactions on Algorithms (TALG)
Tangencies between families of disjoint regions in the plane
Computational Geometry: Theory and Applications
Kinetic pie delaunay graph and its applications
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Improved bounds for incidences between points and circles
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
Pinchasi and Radoičić [On the number of edges in geometric graphs with no self-intersecting cycle of length 4, in: J. Pach (Ed.), Towards a Theory of Geometric Graphs, Contemporary Mathematics, vol. 342, American Mathematical Society, Providence, RI, 2004] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of the neighbors for every vertex in such a graph and order these lists cyclically according to the order of the emanating edges, then the common elements in any two lists have reversed cyclic order. Building on their work we give an improved estimate on the size of the lists having this property. As a consequence we get that a topological graph on n vertices not containing a self-crossing C4 has O(n3/2 log n) edges. Our result also implies that n pseudo-circles in the plane can be cut into O (n3/2 log n) pseudo-segments, which in turn implies bounds on point--curve incidences and on the complexity of a level of an arrangement of curves.