Adjacency Graphs of Polyhedral Surfaces

We study whether a given graph can be realized as an adjacency graph of the polygonal cells of a polyhedral surface in R3. We show that every graph is realizable as a polyhedral surface with arbitrary polygonal cells, and that this is not true if we require the cells to be convex. In particular, if the given graph contains K5, K5,81, or any nonplanar 3-tree as a subgraph, no such realization exists. On the other hand, all planar graphs, K4,4, and K3,5 can be realized with convex cells. The same holds for any subdivision of any graph where each edge is subdivided at least once, and, by a result from McMullen et al. (1983), for any hypercube. Our results have implications on the maximum density of graphs describing polyhedral surfaces with convex cells: The realizability of hypercubes shows that the maximum number of edges over all realizable n-vertex graphs is in Ω(n log n). From the non-realizability of K5,81, we obtain that any realizable n-vertex graph has O(n9/5) edges. As such, these graphs can be considerably denser than planar graphs, but not arbitrarily dense. 2012 ACM Subject Classification Mathematics of computing → Graphs and surfaces; Mathematics of computing → Combinatoric problems

[1]  Richard Cole,et al.  Visibility Problems for Polyhedral Terrains , 2018, J. Symb. Comput..

[2]  J. Pach,et al.  Representation of planar graphs by segments , 1994 .

[3]  Boris Aronov,et al.  Facility Location on a Polyhedral Surface , 2003, Discret. Comput. Geom..

[4]  Martin Tancer,et al.  Embeddability in R3 is NP-hard , 2017, J. ACM.

[5]  Ôôöøøøøóò Óó,et al.  Strictly Convex Drawings of Planar Graphs , 2022 .

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

[7]  Jan Kratochvíl,et al.  Representing graphs by disks and balls (a survey of recognition-complexity results) , 2001, Discret. Math..

[8]  Yifan Hu,et al.  On Touching Triangle Graphs , 2010, GD.

[9]  A. Skopenkov.  Extendability of simplicial maps is undecidable , 2020, ArXiv.

[10]  Lutz Kettner,et al.  Designing a data structure for polyhedral surfaces , 1998, SCG '98.

[11]  David P. Dobkin.  Computational geometry and computer graphics , 1992 .

[12]  Stefan Felsner,et al.  Rectangle and Square Representations of Planar Graphs , 2013 .

[13]  V. Sós,et al.  On a problem of K. Zarankiewicz , 1954 .

[14]  Benjamin Lévêque,et al.  Homothetic triangle representations of planar graphs , 2019, Journal of Graph Algorithms and Applications.

[15]  E. M. Andreev.  ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES , 1970 .

[16]  Linda Kleist,et al.  Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D , 2014, Graph Drawing.

[17]  D. Barnette.  On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs , 1969 .

[18]  Leila De Floriani,et al.  Applications of Computational Geometry to Geographic Information Systems , 2000, Handbook of Computational Geometry.

[19]  David Eppstein,et al.  Steinitz Theorems for Simple Orthogonal Polyhedra , 2014, J. Comput. Geom..

[20]  Jirí Matousek,et al.  Hardness of embedding simplicial complexes in Rd , 2009, SODA.

[21]  Petr Hlinený.  Contact graphs of line segments are NP-complete , 2001, Discret. Math..

[22]  Jürgen Richter-Gebert.  Realization Spaces of Polytopes , 1996 .

[23]  Stefan Felsner,et al.  Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations , 2013, Algorithmica.

[24]  H. Tietze,et al.  Über das Problem der Nachbargebiete im Raum , 1905 .

[25]  Stefan Felsner,et al.  Contact representations of planar graphs with cubes , 2011, SoCG '11.

[26]  Marek Krcál,et al.  Algorithmic Solvability of the Lifting-Extension Problem , 2013, Discrete & Computational Geometry.

[27]  Uli Wagner,et al.  Embeddability of Simplicial Complexes is Undecidable , 2020, SODA.

[28]  Hiroshi Nagamochi,et al.  Extending Steinitz’s Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra , 2011, Algorithmica.

[29]  Arkadiy Skopenkov,et al.  Invariants of Graph Drawings in the Plane , 2018, ArXiv.

[30]  A. D. Mesmay,et al.  Embeddability in $\mathbb{R}^3$ is NP-hard. , 2017, 1708.07734.

[31]  Alexander Wolff,et al.  Representing Graphs and Hypergraphs by Touching Polygons in 3D , 2019, GD.

[32]  Michael Kaufmann,et al.  Optimal Polygonal Representation of Planar Graphs , 2011, Algorithmica.

[33]  Sadish Sadasivam,et al.  On Representation of Planar Graphs by Segments , 2008, AAIM.

[34]  Debajyoti Mondal,et al.  Touching Triangle Representations for 3-Connected Planar Graphs , 2012, GD.

[35]  Peter McMullen,et al.  Polyhedral 2-manifolds inE3 with unusually large genus , 1983 .

[36]  Oded Schramm,et al.  Combinatorically Prescribed Packings and Applications to Conformal and Quasiconformal Maps , 2007, 0709.0710.