Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
A simple method for computing general position in displaying three-dimensional objects
Computer Vision, Graphics, and Image Processing
The annealing algorithm
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Visibility, occlusion, and the aspect graph
International Journal of Computer Vision
Graph drawing by force-directed placement
Software—Practice & Experience
Randomized algorithms
Evaluating stereo and motion cues for visualizing information nets in three dimensions
ACM Transactions on Graphics (TOG)
Fast Interactive 3-D Graph Visualization
GD '95 Proceedings of the Symposium on Graph Drawing
Drawing Nice Projections of Objects in Space
GD '95 Proceedings of the Symposium on Graph Drawing
Finding the Best Viewpoints for Three-Dimensional Graph Drawings
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
On Three-Dimensional Layout of Interconnection Networks
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Graph drawings with few slopes
Computational Geometry: Theory and Applications
| Hi-index | 0.02 |
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.