A note on 3D orthogonal graph drawing

Authors:
Therese Biedl;Timothy M. Chan
Affiliations:
School of Computer Science, University of Waterloo, Waterloo, Ont., Canada;School of Computer Science, University of Waterloo, Waterloo, Ont., Canada
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 5
Cited 2

The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings

Information Processing Letters
Three-dimensional orthogonal graph drawing algorithms

Discrete Applied Mathematics
Orthogonal Drawings with Few Layers

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Optimal three-dimensional orthogonal graph drawing in the general position model

Theoretical Computer Science
Minimising the Number of Bends and Volume in 3-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout

Algorithmica

Multilayer grid embeddings of iterated line digraphs

CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Complexity results for three-dimensional orthogonal graph drawing

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.04

Visualization

Abstract

Some recent papers for three-dimensional orthogonal graph drawing use a technique introduced by Kolmogorov and Barzdin. This technique consists of assigning x-coordinates and y-coordinates, and then computing compatible z-coordinates, which was done via vertex-colouring a conflict graph. In this note, we show that compatible z-coordinates can also be found by edge-colouring a (different) conflict graph. As a consequence, the time complexity for computing the drawings decreases, and the volumes of the drawings are reduced as well.