3D Visibility Representations of 1planar Graphs
Abstract
We prove that every 1planar graph G has a zparallel visibility representation, i.e., a 3D visibility representation in which the vertices are isothetic disjoint rectangles parallel to the xyplane, and the edges are unobstructed zparallel 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 1visibility representation of G.
 Publication:

arXiv eprints
 Pub Date:
 August 2017
 arXiv:
 arXiv:1708.06196
 Bibcode:
 2017arXiv170806196A
 Keywords:

 Computer Science  Computational Geometry
 EPrint:
 Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017)