Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares

TL;DR

This paper presents the first polynomial-time exact algorithm for the orthogonal polygon covering with squares problem, improving upon previous output-sensitive algorithms, and also establishes NP-completeness for the version with holes through a corrected reduction.

Contribution

It introduces a polynomial-time exact algorithm for OPCS with worst-case runtime $\,O(n^{10})$, and a parameterized algorithm based on the number of knobs, plus a corrected NP-completeness proof for OPCSH.

Findings

Developed a polynomial-time algorithm with $\,O(n^{10})$ complexity for OPCS.

Designed a parameterized algorithm efficient when the number of knobs is small.

Provided a correct NP-completeness proof for OPCSH with holes.

Abstract

Let $P$ be an orthogonal polygon of $n$ vertices, without holes. The Orthogonal Polygon Covering with Squares (OPCS) problem takes as input such an orthogonal polygon $P$ with integral vertex coordinates, and asks to find the minimum number of axis-parallel squares whose union is $P$ itself. [Aupperle et. al, 1988] provide an $\mathcal O(N^{1.5})$-time algorithm for OPCS, where $N$ is the number of integral lattice points lying in $P$. In their paper, designing algorithms for OPCS with a running time polynomial in $n$, was stated as an open question; $N$ can be arbitrarily larger than $n$. Output sensitive algorithms were known due to [Bar-Yehuda and Ben-Chanoch, 1994], but these fail to address the open question, as the output can be arbitrarily larger than $n$. We address this open question by designing a polynomial-time exact algorithm for OPCS with a worst-case running time of $\mathcal O(n^{10})$. We also consider the following structural parameterized version of the problem. Let a knob be a polygon edge whose both endpoints are convex polygon vertices. Given an input orthogonal polygon without holes that has $n$ vertices and at most $k$ knobs, we design an algorithm for OPCS with a worst-case running time $\mathcal O(n^2 + k^{10} \cdot n)$. This algorithm is more efficient than the former, whenever $k = o(n^{9/10})$. The problem of Orthogonal Polygon with Holes Covering with Squares (OPCSH) is also studied by [Aupperle et. al, 1988], where the input polygon could have holes. They claim a proof that OPCSH is NP-complete even when the input is the $N$ lattice points inside the polygon. We think there is an error in their proof, where an incorrect reduction from Planar 3-CNF is shown. We provide a correct reduction with a novel construction of one of the gadgets, and show how this leads to a correct proof of NP-completeness of OPCSH.