Abstract
We address the problem of finding viewpoints that preserve the relational structure of a three-dimensional graph drawing under orthographic parallel projection. Previously, algorithms for finding the best viewpoints under two natural models of viewpoint “goodness” were proposed. Unfortunately, the inherent combinatorial complexity of the problem makes finding exact solutions is impractical. In this paper, we propose two approximation algorithms for the problem, commenting on their design, and presenting results on their performance.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Cite
CITATION STYLE
Houle, M. E., & Webber, R. (1999). Approximation algorithms for finding best viewpoints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1547, pp. 210–223). Springer Verlag. https://doi.org/10.1007/3-540-37623-2_16
Readers over time
Readers' Seniority
Readers' Discipline
