The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
Information Processing Letters
Three-dimensional orthogonal graph drawing algorithms
Discrete Applied Mathematics
Proceedings of the 6th International Symposium on Graph Drawing
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Proceedings of the 7th International Symposium on Graph Drawing
GD '99 Proceedings of the 7th International Symposium on Graph Drawing
3DCube: A Tool for Three Dimensional Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
On Improving Orthogonal Drawings: The 4M-Algorithm
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Refinement of Orthogonal Graph Drawings
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Split&Push Approach to 3D Orthogonal Drawing
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
An Algorithm for Three-Dimensional Orthogonal Graph Drawing
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Complexity results for three-dimensional orthogonal graph drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
| Hi-index | 0.00 |
In this paper we introduce a number of techniques for the refinement of three-dimensional orthogonal drawings of maximum degree six graphs. We have implemented several existing algorithms for three-dimensional orthogonal graph drawing including a number of heuristics to improve their performance. The performance of the refinements on the produced drawings is then evaluated in an extensive experimental study. We measure the aesthetic criteria of the bounding box volume, the average and maximum number of bends per edge, and the average and maximum edge length. On the same set of graphs used in Di Battista et al. [3], our main refinement algorithm improves the above aesthetic criteria by 80%, 38%, 10%, 54% and 49%, respectively.