DeepAI AI Chat
Log In Sign Up

Complexity Results on Untangling Red-Blue Matchings

by   Arun Kumar Das, et al.

Given a matching between n red points and n blue points by line segments in the plane, we consider the problem of obtaining a crossing-free matching through flip operations that replace two crossing segments by two non-crossing ones. We first show that (i) it is NP-hard to alpha-approximate the shortest flip sequence, for any constant alpha. Second, we show that when the red points are colinear, (ii) given a matching, a flip sequence of length at most n(n-1)/2 always exists, and (iii) the number of flips in any sequence never exceeds (n(n-1)/2) (n+4)/6. Finally, we present (iv) a lower bounding flip sequence with roughly 1.5 n(n-1)/2 flips, which shows that the n(n-1)/2 flips attained in the convex case are not the maximum, and (v) a convex matching from which any flip sequence has roughly 1.5 n flips. The last four results, based on novel analyses, improve the constants of state-of-the-art bounds.


page 1

page 2

page 3

page 4


Bottleneck Bichromatic Non-crossing Matchings using Orbits

Let R and B be sets of n red and n blue points in the plane, respectivel...

Long Alternating Paths Exist

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

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

On a Tverberg graph

For a graph whose vertex set is a finite set of points in ℝ^d, consider ...

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

The Very Best of Perfect Non-crossing Matchings

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

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