Approximation algorithms for finding best viewpoints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1547, Issue , 1999, Pages 210-223

  Houle, Michael E ^a   Webber, Richard ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957928352     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37623-2_16     Document Type: Conference Paper

References (17)

1. P. K. Agarwal (1991): Intersection and Decomposition Algorithms for Planar Arrangements; Cambridge University Press
2. 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; 1027:52-63
3. M. L. Braunstein (1976): Depth Perception through Motion; Academic Press
4. 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
5. 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
6. R. F. Cohen, P.D. Eades, T. Lin, F. Ruskey (1997): “Three-Dimensional Graph Drawing” in Algorithmica; 17(2):199-208
7. 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
8. H. Edelsbrunner (1987): Algorithms in Combinatorial Geometry; Springer-Verlag
9. J. D. Foley, A. van Dam, S. Feiner, J. Hughes (1990): Computer Graphics: Principles and Practice, 2nd ed.; Addison-Wesley
10. T. M. J. Fruchterman, E. M. Reingold (1991): “Graph Drawing by Force-Directed Placement” in Software–Practice and Experience; 21(11):1129-1164
11. 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
12. 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
13. R. Motwani, P. Raghavan (1995): Randomized Algorithms; Cambridge University Press
14. P. H. J. M. Otten, L. P. P. P. van Ginneken (1989): The Annealing Algorithm; Kluwer Academic
15. H. Plantinga, C. R. Dyer (1990): “Visibility, Occlusion, and the Aspect Graph” in Int. J. Computer Vision; 5(2):137-160
16. 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
17. D. R. Wood (1998): “Two-Bend Three-Dimensional Orthogonal Grid Drawing of Maximum Degree Five Graphs”; in this proceedings