Erratum to: Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number

In this note, we report an error in our paper “Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number” [2]. Given an orthogonal polygon P and a partition of P into rectangles, the stabbing number of the partition is defined as the maximum number of rectangles stabbed by any orthogonal line segment inside P . Abam et al. [1] introduced the problem of finding a partition of P into rectangles with minimum stabbing number and gave a 3-approximation algorithm for this problem. We gave a 2-approximation algorithm for a conforming version of this problem based on a Linear Program (LP) formulation of the problem [2], and claimed that generalizing the LP will also result in a 2-approximation algorithm for the general problem studied by Abam et al. [1]. In this note, we give a counterexample showing that generalizing the LP may not always result in a 2-approximation algorithm for the general version of the problem.