Fully Dynamic 3-Dimensional Orthogonal Graph Drawing
- First Online:
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(n2). 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.
- 1.T. Biedl, Heuristics for 3D-Orthogonal Graph Drawings, Proceedings of the 4th Twente Workshop on Graphs and Combinatorial Optimization, Enshende, June 1995, pp. 41–44.Google Scholar
- 4.P. Eades, A. Symvonis, S. Whitesides, Two Algorithms for Three-Dimensional Orthogonal Graph Drawing, Symposium on Graph Drawing 96, Lecture Notes in Computer Science 1190, Springer Verlag, 1996, pp. 139–154.Google Scholar
- 5.A. Papakostas, I. Tollis, Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions, J. of Graph Algorithms and Applications, to appear.Google Scholar