Copyright © 2005 Elsevier B.V. All rights reserved.
Received 12 December 2003;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
This paper investigates the basic problem of computing crossing-free straight-line 3D grid drawings of graphs such that the overall volume is small. Motivated by their relevance in the literature, we focus on families of graphs having constant queue number and on k-trees. We present algorithms that compute drawings of these families of graphs on 3D grids consisting of a constant number of parallel lines and such that the overall volume is linear. Lower bounds on the number of such grid lines are also provided. Our results extend and improve similar ones already described in the literature.
Keywords: Three-dimensional graph drawing; Track layout; Straight-line drawings







E-mail Article
Add to my Quick Links

Cited By in Scopus (4)







