Fully Dynamic 3-Dimensional Orthogonal Graph Drawing

Closson, M. and Gartshore, S. and Johansen, John and Wismath, Stephen (1999) Fully Dynamic 3-Dimensional Orthogonal Graph Drawing. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 49-58(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_5).

Full text not available from this repository.


In a 3-dimensional orthogonal drawing of a graph, vertices are mapped to grid points on an integer lattice and edges are routed along integer grid lines. In this paper, we present a layout scheme that draws any graph with n vertices of maximum degree 6, using at most 6 bends per edge and in a volume of O(n^{2}). The advantage of our strategy over other drawing methods is that our method is fully dynamic, allowing both insertion and deletion of vertices and edges, while maintaining the volume and bend bounds. The drawing can be obtained in O(n) time and insertions/deletions can be performed in O(1) time. Multiple edges and self loops are permitted. A more elaborate construction that uses only 5 bends per edge, and a simpler, more balanced layout that requires at most 7 bends per edge are also described.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-46648-7_5
Classifications: M Methods > M.300 Dynamic / Incremental / Online
G Algorithms and Complexity > G.210 Bends
P Styles > P.600 Poly-line > P.600.700 Orthogonal
P Styles > P.060 3D
URI: http://gdea.informatik.uni-koeln.de/id/eprint/238

Actions (login required)

View Item View Item