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.
Cite
CITATION STYLE
Eades, P., Houle, M. E., & Webber, R. (1997). Finding the best viewpoints for three-dimensional graph drawings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1353, pp. 87–98). Springer Verlag. https://doi.org/10.1007/3-540-63938-1_53
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
