Planar Point Sets Determine Many Pairwise Crossing Segments

04/18/2019
by   János Pach, et al.
0

We show that any set of n points in general position in the plane determines n^1-o(1) pairwise crossing segments. The best previously known lower bound, Ω(√(n)), was proved more than 25 years ago by Aronov, Erdős, Goddard, Kleitman, Klugerman, Pach, and Schulman. Our proof is fully constructive, and extends to dense geometric graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/22/2021

On Crossing-Families in Planar Point Sets

A k-crossing family in a point set S in general position is a set of k s...
research
12/12/2018

The Crossing Tverberg Theorem

Tverberg's theorem is one of the cornerstones of discrete geometry. It s...
research
02/09/2018

Colored ray configurations

We study the cyclic color sequences induced at infinity by colored rays ...
research
06/01/2019

On problems related to crossing families

Given a set of points in the plane, a crossing family is a collection of...
research
02/26/2019

A new lower bound on the maximum number of plane graphs using production matrices

We use the concept of production matrices to show that there exist sets ...
research
07/03/2023

Short Flip Sequences to Untangle Segments in the Plane

A (multi)set of segments in the plane may form a TSP tour, a matching, a...
research
03/30/2020

Long Alternating Paths Exist

Let P be a set of 2n points in convex position, such that n points are c...

Please sign up or login with your details

Forgot password? Click here to reset