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