1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved

This paper studies three-dimensional orthogonal box-drawings where edge-routes have at most one bend. Two open problems for such drawings are: (1) Does every drawing of Kn have volume (n 3 )? (2) Is there a drawing of Kn for which additionally the vertices are represented by cubes with surface O(n)? This paper answers both questions in the negative, and provides related results concerning volume bounds as well.

[1]  David R. Wood,et al.  Three-Dimensional Orthogonal Graph Drawing with Optimal Volume , 2000, Graph Drawing.

[2]  Therese C. Biedl,et al.  Three Approaches to 3D-Orthogonal Box-Drawings , 1998, GD.

[3]  David R. Wood Three-Dimensional Orthogonal Graph Drawing , 2000 .

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

[5]  A. Lubotzky,et al.  Ramanujan graphs , 2017, Comb..

[6]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.