Infinite trees and the future?

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

Volumn 1731, Issue , 1999, Pages 379-391

  Demetrescu, Camil ^a   Di Battista, Giuseppe ^b   Finocchi, Irene ^a   Liotta, Giuseppe ^c   Patrignani, Maurizio ^b   Pizzonia, Maurizio ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b ROMA TRE UNIVERSITY   (Italy)

^c UNIVERSITY OF PERUGIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); NAVIGATION;

DESIGNING LAYOUT; INFINITE TREES; MENTAL MAPS;

FORESTRY;

EID: 77958487060     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46648-7_39     Document Type: Conference Paper

References (20)

1. Astra. Mercury international. http://www.merc-int.com/.
2. U. Brandes and D. Wagner. A bayesian paradigm for dynamic graph layout. In G. Di Battista, editor, Graph Drawing (Proc. GD ‘97), volume 1353 of Lecture Notes Comput. Sci., pages 236-247. Springer-Verlag, 1998.
3. R. F. Cohen, G. Di Battista, R. Tamassia, and I. G. Tollis. Dynamic graph dra-wings: Trees, series-parallel digraphs, and planar ST-digraphs. SIAM J. Comput., 24(5):970-1001, 1995.
4. P. Crescenzi, C. Demetrescu, I. Finocchi, and R. Petreschi. Leonardo: a software vi-sualization system. In G. Italiano and S. Orlando, editors, Workshop on Algorithm Engineering, pages 146-155, 1997.
5. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.
6. C. A. Duncan, M. Goodrich, and S. Kobourov. Balanced aspect ratio trees and their use for drawing very large graphs. In S. Whitesides, editor, Graph Drawing (Proc. GD ‘98), volume 1547 of Lecture Notes Comput. Sci., pages 384-393. Springer-Verlag, 1999.
7. P. Eades, R. F. Cohen, and M. L. Huang. Online animated graph drawing for web navigation. In G. Di Battista, editor, Graph Drawing (Proc. GD ‘97), volume 1353 of Lecture Notes Comput. Sci., pages 330-335. Springer-Verlag, 1997.
8. P. Eades, W. Lai, K. Misue, and K. Sugiyama. Preserving the mental map of a diagram. In Proceedings of Compugraphics 91, pages 24-33, 1991.
9. T. R. Henry and S. E. Hudson. Viewing large graphs. Technical Report 90-13, Department of Computer Science, University of Arizona, 1990.
10. Hyperbolic Tree. Inxight. http://www.hyperbolictree.com/.
11. K. Kaugars, J. Reinfelds, and A. Brazma. A simple algorithm for drawing large graphs on small screens. In R. Tamassia and I. G. Tollis, editors, Graph Dra-wing (Proc. GD ‘94), volume 894 of Lecture Notes Comput. Sci., pages 278-281. Springer-Verlag, 1995.
12. D. Kimelman, B. Leban, T. Roth, and D. Zernik. Reduction of visual complexity in dynamic graphs. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD ‘94), volume 894 of Lecture Notes Comput. Sci., pages 218-225. Springer-Verlag, 1995.
13. E. B. Messinger, L. A. Rowe, and R. H. Henry. A divide-and-conquer algorithm for the automatic layout of large directed graphs. IEEE Trans. Syst. Man Cybern., SMC-21(1):1-12, 1991.
14. K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout adjustment and the mental map. J. Visual Lang. Comput., 6(2):183-210, 1995.
15. S. Moen. Drawing dynamic trees. IEEE Softw., 7:21-28, 1990.
16. T. Munzner. Exploring large graphs in 3d hyperbolic space. Comp. Graphics and its Applications, 8(4):18-23, 1998.
17. T. Munzner. Drawing large graphs with h3viewer and site manager. In S. Whitesi-des, editor, Graph Drawing (Proc. GD ‘98), volume 1547 of Lecture Notes Comput. Sci., pages 384-393. Springer-Verlag, 1999.
18. S. North. Incremental layout in DynaDAG. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD ‘95), volume 1027 of Lecture Notes Comput. Sci., pages 409- 418. Springer-Verlag, 1996.
19. E. Reingold and J. Tilford. Tidier drawing of trees. IEEE Trans. Softw. Eng., SE-7(2):223-228, 1981.
20. G. J. Wills. NicheWorks-interactive visualization of very large graphs. In G. Di Battista, editor, Graph Drawing (Proc. GD ‘97), volume 1353 of Lecture Notes Comput. Sci., pages 403-414. Springer-Verlag, 1997.