On the Parameterized Complexity of Red-Blue Points Separation

by   Édouard Bonnet, et al.

We study the following geometric separation problem: Given a set R of red points and a set B of blue points in the plane, find a minimum-size set of lines that separate R from B. We show that, in its full generality, parameterized by the number of lines k in the solution, the problem is unlikely to be solvable significantly faster than the brute-force n^O(k)-time algorithm, where n is the total number of points. Indeed, we show that an algorithm running in time f(k)n^o(k/ k), for any computable function f, would disprove ETH. Our reduction crucially relies on selecting lines from a set with a large number of different slopes (i.e., this number is not a function of k). Conjecturing that the problem variant where the lines are required to be axis-parallel is FPT in the number of lines, we show the following preliminary result. Separating R from B with a minimum-size set of axis-parallel lines is FPT in the size of either set, and can be solved in time O^*(9^|B|) (assuming that B is the smallest set).


Red-Blue Point Separation for Points on a Circle

Given a set R of red points and a set B of blue points in the plane, the...

Optimal Discretization is Fixed-parameter Tractable

Given two disjoint sets W_1 and W_2 of points in the plane, the Optimal ...

Red Blue Set Cover Problem on Axis-Parallel Hyperplanes and Other Objects

Given a universe 𝒰=R ∪ B of a finite set of red elements R, and a finite...

Halving by a Thousand Cuts or Punctures

For point sets P_1, …, P_, a set of lines L is halving if any face of t...

Searching for Point Locations using Lines

Versions of the following problem appear in several topics such as Gamma...

Separating Geometric Data with Minimum Cost: Two Disjoint Convex Hulls

In this study, a geometric version of an NP-hard problem ("Almost 2-SAT"...

Quantum algorithms for computational geometry problems

We study quantum algorithms for problems in computational geometry, such...