no code implementations • 4 Mar 2021 • Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi
We prove that there are $O(n)$ tangencies among any set of $n$ red and blue planar curves in which every pair of curves intersects at most once and no two curves of the same color intersect.
Combinatorics
