Optimal 3D Angular Resolution for Low-Degree Graphs
Computational Geometry
2015-07-16 v1
Abstract
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-degree 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-degree angles, i.e., the angular resolution of the diamond lattice, between any two edge segments meeting at a vertex or bend.
Cite
@article{arxiv.1009.0045,
title = {Optimal 3D Angular Resolution for Low-Degree Graphs},
author = {David Eppstein and Maarten Löffler and Elena Mumford and Martin Nöllenburg},
journal= {arXiv preprint arXiv:1009.0045},
year = {2015}
}
Comments
18 pages, 10 figures. Extended version of paper to appear in Proc. 18th Int. Symp. Graph Drawing, Konstanz, Germany, 2010