DeepAI AI Chat
Log In Sign Up

On problems related to crossing families

by   William Evans, et al.

Given a set of points in the plane, a crossing family is a collection of segments, each joining two of the points, such that every two segments intersect internally. Aronov et al. [Combinatorica, 14(2):127-134, 1994] proved that any set of n points contains a crossing family of size Ω(√(n)). They also mentioned that there exist point sets whose maximum crossing family uses at most n/2 of the points. We improve the upper bound on the size of crossing families to 5n/24. We also introduce a few generalizations of crossing families, and give several lower and upper bounds on our generalized notions.


page 1

page 2

page 3

page 4


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...

Planar Point Sets Determine Many Pairwise Crossing Segments

We show that any set of n points in general position in the plane determ...

On the Longest Flip Sequence to Untangle Segments in the Plane

A set of segments in the plane may form a Euclidean TSP tour or a matchi...

The Crossing Tverberg Theorem

Tverberg's theorem is one of the cornerstones of discrete geometry. It s...

The Very Best of Perfect Non-crossing Matchings

Given a set of points in the plane, we are interested in matching them w...

Long Alternating Paths Exist

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

On rich lenses in planar arrangements of circles and related problems

We show that the maximum number of pairwise non-overlapping k-rich lense...