Covering and Packing of Rectilinear Subdivision (1809.07214v1)

Abstract: We study a class of geometric covering and packing problems for bounded regions on the plane. We are given a set of axis-parallel line segments that induces a planar subdivision with a set of bounded (rectilinear) faces. We are interested in the following problems. (P1) Stabbing-Subdivision: Stab all bounded faces by selecting a minimum number of points in the plane. (P2) Independent-Subdivision: Select a maximum size collection of pairwise non-intersecting bounded faces. (P3) Dominating-Subdivision: Select a minimum size collection of faces such that any other face has a non-empty intersection (i.e., sharing an edge or a vertex) with some selected faces. We show that these problems are NP-hard. We even prove that these problems are NP-hard when we concentrate only on the rectangular faces of the subdivision. Further, we provide constant factor approximation algorithms for the Stabbing-Subdivision problem.