Approximation Algorithms for Finding Best Viewpoints

Houle, Michael E. and Webber, Richard (1998) Approximation Algorithms for Finding Best Viewpoints. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998 , pp. 210-223(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_16).

Full text not available from this repository.

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.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-37623-2_16
Classifications: M Methods > M.999 Others
G Algorithms and Complexity > G.999 Others
P Styles > P.060 3D
URI: http://gdea.informatik.uni-koeln.de/id/eprint/289

Actions (login required)

View Item View Item