Incremental Orthogonal Graph Drawing in Three Dimensions

Papakostas, Achilleas and Tollis, Ioannis G. (1998) Incremental Orthogonal Graph Drawing in Three Dimensions. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997 , pp. 52-63(Official URL:

Full text not available from this repository.


We present two algorithms for orthogonal graph drawing in three dimensional space. For graphs of maximum degree six, the 3-D drawing is produced in linear time, has volume at most 4.66n³ and each edge has at most three bends. If the degree of the graph is arbitrary, the vertices are represented by solid 3-D boxes whose surface is proportional to their degree. The produced drawing has two bends per edge. Both algorithms guarantee no crossings and can be used under an interactive setting (i.e., vertices arrive and enter the drawing on-line), as well.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-63938-1_50
Classifications: M Methods > M.300 Dynamic / Incremental / Online
G Algorithms and Complexity > G.420 Crossings
G Algorithms and Complexity > G.210 Bends
P Styles > P.600 Poly-line > P.600.700 Orthogonal
P Styles > P.060 3D

Actions (login required)

View Item View Item