%0 Journal Article %T Counterexample for the 2-approximation of finding partitions of rectilinear polygons with minimum stabbing number %A Breno Piva %A Cid C. de Souza %J Computer Science %D 2015 %I arXiv %X This paper presents a counterexample for the approximation algorithm proposed by Durocher and Mehrabi [1] for the general problem of finding a rectangular partition of a rectilinear polygon with minimum stabbing number. %U http://arxiv.org/abs/1506.03865v1