This paper studies the problem of computing 3D crossing-free straight-line grid drawings of graphs such that the overall volume is small. We show that every 2-tree (and therefore every series-parallel graph) can be drawn on an integer 3D grid consisting of 15 parallel lines and having linear volume. We extend the study to the problem of drawing general k-trees on a set of parallel grid lines. L...
