EPPSTEIN, David. The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing. Journal of Graph Algorithms and Applications, [S. l.], v. 17, n. 1, p. 35–55, 2013. DOI: 10.7155/jgaa.00283. Disponível em: http://jgaa-v4.cs.brown.edu/index.php/jgaa/article/view/paper283. Acesso em: 6 jul. 2024.