Separating Colored Points with Minimum Number of Rectangles

07/21/2021

∙

by   Navid Assadian, et al.

∙

0

∙

share

In this paper we study the following problem: Given k disjoint sets of points, P_1, …, P_k on the plane, find a minimum cardinality set 𝒯 of arbitrary rectangles such that each rectangle contains points of just one set P_i but not the others. We prove the NP-hardness of this problem.