Decomposition of Geometric Set Systems and Graphs

We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold covering of the plane with its translates is decomposable into two disjoint coverings of the whole plane. Pach conjectured that every convex set is cover-decomposable. We verify his conjecture for polygons. Moreover, if m is large enough, we prove that any m-fold covering can even be decomposed into k coverings. Then we show that the situation is exactly the opposite in 3 dimensions, for any polyhedron and any $m$ we construct an m-fold covering of the space that is not decomposable. We also give constructions that show that concave polygons are usually not cover-decomposable. We start the first part with a detailed survey of all results on the cover-decomposability of polygons. The second part investigates another geometric partition problem, related to planar representation of graphs. The slope number of a graph G is the smallest number s with the property that G has a straight-line drawing with edges of at most s distinct slopes and with no bends. We examine the slope number of bounded degree graphs. Our main results are that if the maximum degree is at least 5, then the slope number tends to infinity as the number of vertices grows but every graph with maximum degree at most 3 can be embedded with only five slopes. We also prove that such an embedding exists for the related notion called slope parameter. Finally, we study the planar slope number, defined only for planar graphs as the smallest number s with the property that the graph has a straight-line drawing in the plane without any crossings such that the edges are segments of only s distinct slopes. We show that the planar slope number of planar graphs with bounded degree is bounded.

[1]  Bruno Simeone,et al.  ON THE GENERAL THEORETICAL RESULTS FOR RECTILINEAR EMBEDDABILITY OF GRAPHS , 1991 .

[2]  Balázs Keszegh,et al.  Drawing Cubic Graphs with at Most Five Slopes , 2006, Graph Drawing.

[3]  Balázs Keszegh,et al.  Drawing Planar Graphs of Bounded Degree with Few Slopes , 2010, Graph Drawing.

[4]  J. Pach.  Towards a Theory of Geometric Graphs , 2004 .

[5]  Suresh Venkatasubramanian,et al.  Restricted strip covering and the sensor cover problem , 2007, SODA '07.

[6]  Bojan Mohar,et al.  A polynomial time circle packing algorithm , 1993, Discret. Math..

[7]  Patrice Ossona de Mendez,et al.  On Triangle Contact Graphs , 1994, Combinatorics, Probability and Computing.

[8]  Gábor Tardos,et al.  Multiple Coverings of the Plane with Triangles , 2007, Discret. Comput. Geom..

[9]  Balázs Keszegh,et al.  Polychromatic colorings of arbitrary rectangular partitions , 2010, Discret. Math..

[10]  David Eppstein,et al.  The geometric thickness of low degree graphs , 2003, SCG '04.

[11]  Matt Gibson,et al.  Decomposing Coverings and the Planar Sensor Cover Problem , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[12]  David Eppstein,et al.  Journal of Graph Algorithms and Applications Geometric Thickness of Complete Graphs , 2022 .

[13]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[14]  Jirí Matousek,et al.  Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness , 2006, Electron. J. Comb..

[15]  Roberto Tamassia,et al.  Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract) , 1994, ESA.

[16]  Dömötör Pálvölgyi,et al.  Indecomposable Coverings with Concave Polygons , 2010, Discret. Comput. Geom..

[17]  János Pach,et al.  Covering the plane with convex polygons , 1986, Discret. Comput. Geom..

[18]  Thomas C. Shermer,et al.  On representations of some thickness-two graphs , 1995, Comput. Geom..

[19]  János Pach,et al.  Decomposition of multiple coverings into many parts , 2007, SCG '07.

[20]  Robert E. Jamison,et al.  Few slopes without collinearity , 1986, Discret. Math..

[21]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[22]  J. Pach,et al.  Decomposition problems for multiple coverings with unit balls, manuscript. , 1988 .

[23]  Géza Tóth,et al.  Convex Polygons are Cover-Decomposable , 2010, Discret. Comput. Geom..

[24]  Mario Szegedy,et al.  Geometric representation of cubic graphs with four directions , 2009, Comput. Geom..

[25]  Paul C. Kainen,et al.  Thickness and coarseness of graphs , 1973 .

[26]  David R. Wood,et al.  Graph Treewidth and Geometric Thickness Parameters , 2005, GD.

[27]  Goos Kant,et al.  A Better Heuristic for Orthogonal Graph Drawings , 1994, ESA.

[28]  David R. Wood,et al.  Really Straight Graph Drawings , 2004, GD.

[29]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[30]  Seth M. Malitz,et al.  On the angular resolution of planar graphs , 1992, STOC '92.

[31]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[32]  J. Pach.  Decomposition of multiple packing and covering , 1980 .

[33]  Jean Cardinal,et al.  Decomposition of Multiple Coverings into More Parts , 2008, SODA.

[34]  D. S. Arnon,et al.  Algorithms in real algebraic geometry , 1988 .

[35]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[36]  Thomas C. Shermer,et al.  On representations of some thickness-two graphs , 1999, Comput. Geom..

[37]  David R. Wood,et al.  Graph drawings with few slopes , 2007, Comput. Geom..

[38]  A. Morgana,et al.  General theoretical results on rectilinear embedability of graphs , 1991 .

[39]  David Eppstein,et al.  Drawings of planar graphs with few slopes and segments , 2007, Comput. Geom..

[40]  Peter Robinson,et al.  Drawability of Complete Graphs Using a Minimal Slope Set , 1994, Comput. J..

[41]  Peter Ungar.  On Diagrams Representing Maps , 1953 .

[42]  Balázs Keszegh,et al.  Cubic Graphs Have Bounded Slope Parameter , 2008, Graph Drawing.

[43]  Márton Elekes,et al.  On splitting infinite-fold covers , 2009, 0911.2774.

[44]  Petra Mutzel,et al.  The Thickness of Graphs: A Survey , 1998, Graphs Comb..

[45]  János Pach,et al.  Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers , 2006, Electron. J. Comb..