DeepAI AI Chat
Log In Sign Up

On Crossing-Families in Planar Point Sets

by   Oswin Aichholzer, et al.
Charles University in Prague
Berlin Institute of Technology (Technische Universität Berlin)
TU Graz

A k-crossing family in a point set S in general position is a set of k segments spanned by points of S such that all k segments mutually cross. In this short note we present two statements on crossing families which are based on sets of small cardinality: (1) Any set of at least 15 points contains a crossing family of size 4. (2) There are sets of n points which do not contain a crossing family of size larger than 8⌈n/41⌉. Both results improve the previously best known bounds.


page 1

page 2

page 3

page 4


On problems related to crossing families

Given a set of points in the plane, a crossing family is a collection of...

Planar Point Sets Determine Many Pairwise Crossing Segments

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

Grading the Severity of Arteriolosclerosis from Retinal Arterio-venous Crossing Patterns

The status of retinal arteriovenous crossing is of great significance fo...

From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices

A set P = H ∪{w} of n+1 points in general position in the plane is calle...

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