Finding the Best Viewpoints for Three-Dimensional Graph Drawings

Eades, Peter and Houle, Michael E. and Webber, Richard (1998) Finding the Best Viewpoints for Three-Dimensional Graph Drawings. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997 , pp. 87-98(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_53).

Full text not available from this repository.

Abstract

In this paper we adress the problem of finding the best viewpoints for three-dimensional straight-line graph drawings. We define goodness in terms of preserving the relational structure of the graph, and develop two continuous measures of goodness under othographic parallel projection. We develop Voronoi variants to find the best viewpoints under these measures, and present results on the complexity of these diagrams.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-63938-1_53
Classifications: P Styles > P.720 Straight-line
G Algorithms and Complexity > G.999 Others
P Styles > P.060 3D
URI: http://gdea.informatik.uni-koeln.de/id/eprint/71

Actions (login required)

View Item View Item