Orthogonal Drawings with Few Layers
Biedl, Therese and Johansen, John and Shermer, Thomas and Wood, David R. (2002) Orthogonal Drawings with Few Layers. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 297-311 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_24).
Full text not available from this repository.
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a small number of layers is easier to parse for humans, we study drawings where one dimension is restricted to be very small. We give algorithms to obtain point-drawings with 3 layers and 4 bends per edge, and algorithms to obtain box-drawings with 2 layers and 2 bends per edge. Several other related results are included as well. Our constructions have optimal volume, which we prove by providing lower bounds.
Repository Staff Only: item control page