DeepAI AI Chat
Log In Sign Up

Bottleneck Bichromatic Non-crossing Matchings using Orbits

by   Marko Savić, et al.
University of Novi Sad

Let R and B be sets of n red and n blue points in the plane, respectively, with P = R ∪ B. Let M be a perfect matching between points from R and B, using n straight line segments to match the points, that is, each point is an endpoint of exactly one line segment, and each line segment has one red and one blue endpoint. We forbid line segments to cross. Denote the length of a longest line segment in M with bn(M), which we also call the [ ]value, bn of M. We aim to find a matching under given constraints that minimizes bn(M). Any such matching is called a [ ]bottleneck matching of P.


Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets

Let R and B be a set of red points and a set of blue points in the plane...

Complexity Results on Untangling Red-Blue Matchings

Given a matching between n red points and n blue points by line segments...

Computation of the Hausdorff distance between sets of line segments in parallel

We show that the Hausdorff distance for two sets of non-intersecting lin...

Approximating the discrete and continuous median line segments in d dimensions

Consider a set P of n points in ℝ^d. In the discrete median line segment...

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 the self-similarity of line segments in decaying homogeneous isotropic turbulence

The self-similarity of a passive scalar in homogeneous isotropic decayin...