An Algorithm for Three-Dimensional Orthogonal Graph Drawing

Abstract. In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the movement of vertices from an initial layout along the main diagonal of a cube. For an n-vertex m-edge graph with maximum degree six, the algorithm produces drawings with bounding box volume at most 2.37n3 and with a total of 7m/3 bends, using no more than 4 bends per edge route. For maximum degree five graphs the bounding box has volume n3 and each edge route has two bends. These results establish new bounds for 3-dimensional orthogonal graph drawing algorithms and improve on some existing bounds.

• Type: Conference
• Year: 1998
• Where: GD
• Authors: David R. Wood
• Keywords: 3-dimensional Orthogonal Graph, Bounding Box, Computer Graphics, GD 1998, Graph Drawing