A crossing lemma for Jordan curves
From MaRDI portal
Publication:1647400
DOI10.1016/j.aim.2018.03.015zbMath1394.52028arXiv1708.02077OpenAlexW2963297325WikidataQ124968975 ScholiaQ124968975MaRDI QIDQ1647400
János Pach, Natan Rubin, Gábor Tardos
Publication date: 26 June 2018
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.02077
Related Items
On the number of tangencies among 1-intersecting \(x\)-monotone curves, Planar point sets determine many pairwise crossing segments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tangencies between families of disjoint regions in the plane
- On the Erdős distinct distances problem in the plane
- Ramsey-type theorems
- A combinatorial distinction between the Euclidean and projective planes
- Extremal problems in discrete geometry
- Combinatorial complexity bounds for arrangements of curves and spheres
- Separator theorems and Turán-type results for planar intersection graphs
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- \(\epsilon\)-nets and simplex range queries
- On the intersections of systems of curves
- Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)
- How to cut pseudoparabolas into segments
- Improved bounds for planar \(k\)-sets and related problems
- Applications of random sampling in computational geometry. II
- Cutting circles into pseudo-segments and improved bounds for incidences
- Intersecting curves in the plane
- Algebraic methods in discrete analogs of the Kakeya problem
- Distinct distance estimates and low degree polynomial partitioning
- Intersection reverse sequences and geometric applications.
- Incidence Theorems and Their Applications
- A Separator Theorem for String Graphs and its Applications
- On levels in arrangements of curves, iii
- Crossing-Free Subgraphs
- On the Number of Incidences Between Points and Curves
- Beyond the Richter-Thomassen Conjecture
- New bounds on curve tangencies and orthogonalities
- Pseudo-Line Arrangements: Duality, Algorithms, and Applications
- Polynomial partitioning for a set of varieties
- Improved Bounds for Incidences Between Points and Circles
- On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves
- Intersection patterns of curves
- Near-Optimal Separators in String Graphs
- Lenses in arrangements of pseudo-circles and their applications
- Toward a theory of crossing numbers
- On a problem of K. Zarankiewicz
- On Sets of Distances of n Points
- String graphs and incomparability graphs
