Refinement of Three-Dimensional Orthogonal Graph Drawings

Lynn, Benjamin Y. S. and Symvonis, Antonios and Wood, David R. (2001) Refinement of Three-Dimensional Orthogonal Graph Drawings. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 308-320(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_29).

Full text not available from this repository.

Abstract

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.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-44541-2_29
Classifications: G Algorithms and Complexity > G.999 Others
G Algorithms and Complexity > G.070 Area / Edge Length
D Aesthetics > D.999 Others
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/409

Actions (login required)

View Item View Item