Computing straight-line 3D grid drawings of graphs in linear volume

@article{Giacomo2005ComputingS3,
  title={Computing straight-line 3D grid drawings of graphs in linear volume},
  author={Emilio Di Giacomo and Giuseppe Liotta and Henk Meijer},
  journal={Comput. Geom.},
  year={2005},
  volume={32},
  pages={26-58}
}
This paper investigates the basic problem of computing crossing-free straight-line 3D grid drawings of such that the overall volume is small. Motivated by their relevance in the literature, we focus on families of having constant queue number and on k-trees. We present algorithms that compute drawings of these famili graphs on 3D grids consisting of a constant number of parallel lines and such that the overall volume i Lower bounds on the number of such grid lines are also provided. Our results… CONTINUE READING