Approximation Algorithms For Finding Best Viewpoints

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 Ending 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.