Optimal 3D Angular Resolution for Low-Degree Graphs

We show that every graph of maximum degree three can be drawn in three dimensions with at most two bends per edge, and with 120° angles between any two edge segments meeting at a vertex or a bend. We show that every graph of maximum degree four can be drawn in three dimensions with at most three bends per edge, and with 109.5° angles, i. e., the angular resolution of the diamond lattice, between any two edge segments meeting at a vertex or bend.

[1]  Michael Kaufmann,et al.  On the Perspectives Opened by Right Angle Crossing Drawings , 2009, J. Graph Algorithms Appl..

[2]  B. W. Clare,et al.  The closest packing of equal circles on a sphere , 1986, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[3]  Peter Eades,et al.  Effects of Crossing Angles , 2008, 2008 IEEE Pacific Visualization Symposium.

[4]  Achilleas Papakostas,et al.  On the Angular Resolution of Planar Graphs , 1994, SIAM J. Discret. Math..

[5]  J. Petersen.  Die Theorie der regulären graphs , 1891 .

[6]  Walter Didimo,et al.  Drawing Graphs with Right Angle Crossings , 2009, WADS.

[7]  Prosenjit Bose,et al.  Efficient algorithms for Petersen's matching theorem , 1999, SODA '99.

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

[9]  Tao Lin,et al.  Three-dimensional graph drawing , 1994, Algorithmica.

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

[11]  F. Leighton,et al.  Drawing graphs in the plane with high resolution , 1993 .

[12]  Stefan Felsner,et al.  Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions , 2001, J. Graph Algorithms Appl..

[13]  Joachim Gudmundsson,et al.  Notes on Large Angle Crossing Graphs , 2009, Chic. J. Theor. Comput. Sci..

[14]  Petra Mutzel,et al.  Planar Polyline Drawings with Good Angular Resolution , 1998, GD.

[15]  David Eppstein,et al.  Trees with Convex Faces and Optimal Angles , 2006, Graph Drawing.

[16]  David R. Wood,et al.  Optimal three-dimensional orthogonal graph drawing in the general position model , 2003, Theor. Comput. Sci..

[17]  David Eppstein,et al.  Isometric Diamond Subgraphs , 2008, GD.

[18]  Antonios Symvonis,et al.  Three-dimensional orthogonal graph drawing algorithms , 2000, Discret. Appl. Math..

[19]  Sándor P. Fekete,et al.  Orthogonal Graph Drawing , 2001, Drawing Graphs.

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

[21]  P. Tammes.  On the origin of number and arrangement of the places of exit on the surface of pollen-grains , 1930 .

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

[23]  Michael Kaufmann,et al.  Journal of Graph Algorithms and Applications on the Perspectives Opened by Right Angle Crossing Drawings , 2022 .