Abstract
An optimal bsp for a set S of disjoint line segments in the plane is a bsp for S that produces the minimum number of cuts. We study optimal bsps for three classes of bsps, which differ in the splitting lines that can be used when partitioning a set of fragments in the recursive partitioning process: free bsps can use any splitting line, restricted bsps can only use splitting lines through pairs of fragment endpoints, and auto-partitions can only use splitting lines containing a fragment. We obtain the two following results:
-
It is np-hard to decide whether a given set of segments admits an auto-partition that does not make any cuts.
-
An optimal restricted bsp makes at most 2 times as many cuts as an optimal free bsp for the same set of segments.
This research was supported by the Netherlands’ Organisation for Scientific Research (NWO) under project no. 639.023.301.
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
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)
de Berg, M., de Groot, M.M., Overmars, M.H.: Perfect binary space partitions. Comput. Geom. Theory Appl. 7, 81–91 (1997)
de Berg, M., Mumford, E., Speckmann, B.: Optimal BSPs and rectilinear cartograms. In: Proc. 14th Int. Symp. Adv. Geographic Inf. Syst. (ACM-GIS), pp. 19–26 (2006)
Clairbois, X.: On Optimal Binary Space Partitions. MSc thesis, TU Eindhoven (2006)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)
Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. Discr. Comput. Math. 5, 422–427 (1992)
Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11, 329–343 (1982)
Tóth, C.D.: Binary space partitions: recent developments. In: Goodman, J.E., Pach, J., Welzl, E. (eds.) Combinatorial and Computational Geometry. MSRI Publications, vol. 52, pp. 525–552. Cambridge University Press, Cambridge (2005)
Katz, B., Rutter, I., Woeginger, G.: An algorithmic study of switch graphs. In: Paul, C. (ed.) WG 2009. LNCS, vol. 5911, pp. 226–237. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Berg, M., Khosravi, A. (2010). Optimal Binary Space Partitions in the Plane. In: Thai, M.T., Sahni, S. (eds) Computing and Combinatorics. COCOON 2010. Lecture Notes in Computer Science, vol 6196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14031-0_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-14031-0_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14030-3
Online ISBN: 978-3-642-14031-0
eBook Packages: Computer ScienceComputer Science (R0)