article: On the coarseness of bicolored point sets

Here is the link.

keywords:

[Mathematics]

[Computational Geometry]

[discrepancy]

[clustering]

[algorithms]

[red-blue separability]

[convex partition]

[2n points on a circle]

[NP-hard]

[optimal solution]

[separates the interior of P from the interior of Q]

[3SUM-hard]

[hardness of solution]