3D Visibility Representations of 1-planar Graphs

We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibility representation in which the vertices are isothetic disjoint rectangles parallel to the xy-plane, and the edges are unobstructed z-parallel visibilities between pairs of rectangles. In addition, the constructed representation is such that there is a plane that intersects all the rectangles, and this intersection defines a bar 1-visibility representation of G.

[1]  Ellen Gethner,et al.  Bar k-Visibility Graphs , 2007, J. Graph Algorithms Appl..

[2]  Sándor P. Fekete,et al.  New Results on a Visibility Representation of Graphs in 3D , 1995, GD.

[3]  Prosenjit Bose,et al.  On Rectangle Visibility Graphs , 1996, GD.

[4]  Thomas C. Shermer,et al.  On Rectangle Visibility Graphs. III. External Visibility and Complexity , 1996, CCCG.

[5]  Franz-Josef Brandenburg.  1-Visibility Representations of 1-Planar Graphs , 2014, J. Graph Algorithms Appl..

[6]  Ferran Hurtado,et al.  On a Visibility Representation of Graphs , 1995, GD.

[7]  Stephen K. Wismath,et al.  Characterizing bar line-of-sight graphs , 1985, SCG '85.

[8]  Giuseppe Liotta,et al.  Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs , 2015, Discrete & Computational Geometry.

[9]  Joan P. Hutchinson,et al.  Rectangle-Visibility Representations of Bipartite Graphs , 1994, Graph Drawing.

[10]  M. Kaufmann.  Bar 1-Visibility Graphs vs. other Nearly Planar Graphs , 2014 .

[11]  Roberto Tamassia,et al.  Algorithms for Plane Representations of Acyclic Digraphs , 1988, Theor. Comput. Sci..

[12]  Robert E. Tarjan,et al.  Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..

[13]  Emilio Di Giacomo,et al.  Visibility Representations of Boxes in 2.5 Dimensions , 2016, GD.

[14]  Emilio Di Giacomo,et al.  Ortho-Polygon Visibility Representations of Embedded Graphs , 2016, Graph Drawing.

[15]  Giuseppe Liotta,et al.  Graph drawing beyond planarity: some results and open problems , 2014, ICTCS.

[16]  Michael Kaufmann,et al.  Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452) , 2016, Dagstuhl Reports.

[17]  Alexander Grigoriev,et al.  Algorithms for Graphs Embeddable with Few Crossings per Edge , 2005, Algorithmica.

[18]  Michael A. Bekos,et al.  On Optimal 2- and 3-Planar Graphs , 2017, Symposium on Computational Geometry.

[19]  Giuseppe Liotta,et al.  An annotated bibliography on 1-planarity , 2017, Comput. Sci. Rev..

[20]  Sándor P. Fekete,et al.  Rectangle and Box Visibility Graphs in 3D , 1999, Int. J. Comput. Geom. Appl..

[21]  János Pach,et al.  Graphs drawn with few crossings per edge , 1996, GD.

[22]  Jan Stola.  Unimaximal Sequences of Pairs in Rectangle Visibility Drawing , 2008, Graph Drawing.

[23]  K. Wagner,et al.  Bemerkungen zu einem Sechsfarbenproblem von G. Ringel , 1983 .

[24]  Hazel Everett,et al.  A Visibility Representation for Graphs in Three Dimensions , 1998, J. Graph Algorithms Appl..

[25]  Vladimir P. Korzhik,et al.  Minimal Obstructions for 1‐Immersions and Hardness of 1‐Planarity Testing , 2013, J. Graph Theory.

[26]  Roberto Tamassia,et al.  A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..

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