Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares

Anubhav Dhar, Subham Ghosh, Sudeshna Kolay

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 inte…