1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved

Authors

  • Therese Biedl

DOI:

https://doi.org/10.7155/jgaa.00034

Abstract

This paper studies three-dimensional orthogonal box-drawings where edge-routes have at most one bend. Two open problems for such drawings are: (1) Does every drawing of $K_n$ have volume $\Omega(n^3)$? (2) Is there a drawing of $K_n$ for which additionally the vertices are represented by cubes with surface $O(n)$? This paper answers both questions in the negative, and provides related results concerning volume bounds as well.

Downloads

Download data is not yet available.

Downloads

Published

2001-01-01

How to Cite

Biedl, T. (2001). 1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved. Journal of Graph Algorithms and Applications, 5(3), 1–15. https://doi.org/10.7155/jgaa.00034

Issue

Section

Articles

Categories