Abstract
The stabbing number of a partition of a rectilinear polygon P into rectangles is the maximum number of rectangles stabbed by any axis-parallel line segment contained in P. We consider the problem of finding a rectangular partition with minimum stabbing number for a given rectilinear polygon P. First, we impose a conforming constraint on partitions: every vertex of every rectangle in the partition must lie on the polygon’s boundary. We show that finding a conforming rectangular partition of minimum stabbing number is NP-hard for rectilinear polygons with holes. We present a rounding method based on a linear programming relaxation resulting in a polynomial-time 2-approximation algorithm. We give an O(nlogn)-time algorithm to solve the problem exactly when P is a histogram (some edge in P can see every point in P) with n vertices. Next we relax the conforming constraint and show how to extend the first linear program to achieve a polynomial-time 2-approximation algorithm for the general problem, improving the approximation factor achieved by Abam, Aronov, de Berg, and Khosravi (ACM SoCG 2011).
Work supported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abam, M.A., Aronov, B., de Berg, M., Khosravi, A.: Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. In: Proc. ACM SoCG, pp. 407–416 (2011)
de Berg, M., Khosravi, A., Verdonschot, S., van der Weele, V.: On Rectilinear Partitions with Minimum Stabbing Number. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 302–313. Springer, Heidelberg (2011)
de Berg, M., van Kreveld, M.: Rectilinear decompositions with low stabbing number. Inf. Proc. Let. 52(4), 215–221 (1994)
Efrat, A., Erten, C., Kobourov, S.: Fixed-location circular arc drawing of planar graphs. J. Graph Alg. & Applications 11(1), 165–193 (2007)
Fekete, S., Lübbecke, M., Meijer, H.: Minimizing the stabbing number of matchings, trees, and triangulations. Disc. Comp. Geom. 40, 595–621 (2008)
Gourley, K., Green, D.: A polygon-to-rectangle conversion algorithm. IEEE Comp. Graphics & App. 3(1), 31–36 (1983)
Hershberger, J., Suri, S.: A pedestrian approach to ray shooting: shoot a ray, take a walk. J. Alg. 18(3), 403–431 (1995)
Katz, M.J., Morgenstern, G.: Guarding orthogonal art galleries with sliding cameras. Inter. J. Comp. Geom. & App. 21(2), 241–250 (2011)
Knuth, D., Raghunathan, A.: The problem of compatible representatives. SIAM J. Disc. Math. 5(3), 422–427 (1992)
Lopez, M., Mehta, D.: Efficient decomposition of polygons into L-shapes with application to VLSI layouts. ACM Trans. Design Automation Elec. Sys. 1(3), 371–395 (1996)
Punnen, A.: K-sum linear programming. J. Oper. Res. Soc. 43(4), 359–363 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Durocher, S., Mehrabi, S. (2012). Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds) Computing and Combinatorics. COCOON 2012. Lecture Notes in Computer Science, vol 7434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32241-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-32241-9_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32240-2
Online ISBN: 978-3-642-32241-9
eBook Packages: Computer ScienceComputer Science (R0)