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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
P. K. Agarwal(1991): Intersection and Decomposition Algorithms for Planar Arrangements; Cambridge University Press
P. Bose, F. Gomez, P. Ramos, G. Toussaint (1995): “Drawing Nice Projections of Objects in Space” in Proc. 3rd Int. Symp. Graph Drawing (Passau, Germany); Springer-Verlag, LNCS;:52–63
M. L. Braunstein (1976): Depth Perception through Motion; Academic Press
I. Bruß, A. K. Frick (1995): “Fast Interactive 3-D Graph Visualization” in Proc. 3rd Int. Symp. Graph Drawing (Passau, Germany); Springer-Verlag, LNCS; 1027:99–110
T. Calamoneri, A. Massini (1997): “On Three-Dimensional Layout of Interconnection Networks” in Proc. 5th Int. Symp. Graph Drawing (Rome); Springer-Verlag, LNCS; 1353:64–75
R. F. Cohen, P. D. Eades, T. Lin, F. Ruskey (1997): “Three-Dimensional Graph Drawing” in Algorithmica; 17(2):199–208
P. D. Eades, M. E. Houle, R. Webber (1997): “Finding the Best Viewpoints for Three-Dimensional Graph Drawings” in Proc. 5th Int. Symp. Graph Drawing (Rome); Springer-Verlag, LNCS; 1353:87–98
H. Edelsbrunner (1987): Algorithms in Combinatorial Geometry; Springer-Verlag
J. D. Foley, A. van Dam, S. Feiner, J. Hughes (1990): Computer Graphics: Principles and Practice, 2nd ed.; Addison-Wesley
T. M. J. Fruchterman, E. M. Reingold (1991): “Graph Drawing by Force-Directed Placement” in Software-Practice and Experience; 21(11):1129–1164
T. Kamada, S. Kawai (1988): “A Simple Method for Computing General Position in Displaying Three-Dimensional Objects” in Computer Vision, Graphics and Image Processing; 41(1):43–56
K. Misue, P. D. Eades, W. Lai, K. Sugiyama (1995): “Layout Adjustment and the Mental Map” in J. Visual Languages and Computing; 6:183–210
R. Motwani, P. Raghavan (1995): Randomized Algorithms; Cambridge University Press
P. H. J. M. Otten, L. P. P. P. van Ginneken (1989): The Annealing Algorithm; Kluwer Academic
H. Plantinga, C. R. Dyer (1990): “Visibility, Occlusion, and the Aspect Graph” in Int. J. Computer Vision; 5(2):137–160
C. Ware, G. Franck (1996): “Evaluating Stereo and Motion Cues for Visualizing Information Nets in Three Dimensions” in ACM Trans. Graphics; 15(2):121–140
D. R. Wood (1998): “Two-Bend Three-Dimensional Orthogonal Grid Drawing of Maximum Degree Five Graphs”; in this proceedings
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Houle, M.E., Webber, R. (1998). Approximation Algorithms for Finding Best Viewpoints. In: Whitesides, S.H. (eds) Graph Drawing. GD 1998. Lecture Notes in Computer Science, vol 1547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37623-2_16
Download citation
DOI: https://doi.org/10.1007/3-540-37623-2_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65473-5
Online ISBN: 978-3-540-37623-1
eBook Packages: Springer Book Archive