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