Eppstein, David. “The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing”. Journal of Graph Algorithms and Applications 17, no. 1 (January 1, 2013): 35–55. Accessed June 15, 2025. https://jgaa-v4.cs.brown.edu/index.php/jgaa/article/view/paper283.