Eppstein, D. (2013) “The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing”, Journal of Graph Algorithms and Applications, 17(1), pp. 35–55. doi: 10.7155/jgaa.00283.