Finding the Best Viewpoints for Three-Dimensional Graph Drawings (1997)
by
Peter Eades
,
Michael E. Houle
,
Richard Webber
| Venue: | Proc. 5th International Symp. on Graph Drawing (GD ’97 |
| Citations: | 19 - 0 self |
BibTeX
@INPROCEEDINGS{Eades97findingthe,
author = {Peter Eades and Michael E. Houle and Richard Webber},
title = {Finding the Best Viewpoints for Three-Dimensional Graph Drawings},
booktitle = {Proc. 5th International Symp. on Graph Drawing (GD ’97},
year = {1997},
pages = {87--98},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we address 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 orthographic parallel projection. We develop Voronoi variants to find the best viewpoints under these measures, and present results on the complexity of these diagrams.
