Separating Colored Points with Minimum Number of Rectangles
Abstract
In this paper we study the following problem: Given $k$ disjoint sets of points, $P_1, \ldots, P_k$ on the plane, find a minimum cardinality set $\mathcal{T}$ of arbitrary rectangles such that each rectangle contains points of just one set $P_i$ but not the others. We prove the NPhardness of this problem.
 Publication:

arXiv eprints
 Pub Date:
 July 2021
 arXiv:
 arXiv:2107.09821
 Bibcode:
 2021arXiv210709821A
 Keywords:

 Computer Science  Computational Geometry