Volume Requirements of 3D Upward Drawings
This paper studies the problem of drawing directed acyclic graphs in three dimensions in the straight-line grid model, and so that all directed edges are oriented in a common (upward) direction. We show that there exists a family of outerplanar directed acyclic graphs whose volume requirement is super-linear. We also prove that for the special case of rooted trees a linear volume upper bound is achievable.
KeywordsPlanar Graph Directed Acyclic Graph Undirected Graph Hamiltonian Path Volume Requirement
- 8.Di Giacomo, E., Liotta, G., Meijer, H.: Computing straight-line 3D grid drawings of graphs in linear volume. Computational Geometry (to appear)Google Scholar
- 12.Dujmović, V., Wood, D.R.: Three-dimensional grid drawings with sub-quadratic volume. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs, vol. 342, pp. 55–66 (2004)Google Scholar
- 19.Poranen, T.: A new algorithm for drawing series-parallel digraphs in 3D. Technical Report A-2000-16, Dept. of Computer and Information Sciences, University of Tampere, Finland (2000)Google Scholar