Three-dimensional 1-bend graph drawings

We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum volume of such a drawing is (cn), where n is the number of vertices and c is the cutwidth of the graph. We then prove that every graph has a three-dimensional grid-drawing with O(n3 / log2 n) volume and one bend per edge. The best previous bound was O(n3 ). Article Type Communicated by Submitted Revised concise paper G. Liotta April 2004 March 2005 Presented at the 16th Canadian Conference on Computational Geometry (CCCG '04), Concordia University, Montr

• Type: Conference
• Year: 2004
• Where: CCCG
• Authors: Pat Morin, David R. Wood
• Keywords: April 2004 March, CCCG 2004, CCCG 2007, Submitted Revised Concise, Three-dimensional Grid-drawing