Separating Colored Points with Minimum Number of Rectangles
Abstract
In this paper we study the following problem: Given k disjoint sets of points, P1, …, Pk on the plane, find a minimum cardinality set T of arbitrary rectangles such that each rectangle contains points of just one set Pi but not the others. We prove the NP-hardness of this problem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.