Skip to main content
SpringerLink
Log in

Tulip — A Huge Graph Visualization Framework

  • Chapter
Graph Drawing Software

Part of the book series: Mathematics and Visualization ((MATHVISUAL))

Abstract

The research by the information visualization community (“Info Viz”) shows clearly that using a visual representation of data-sets enables faster analysis by the end users. Several scientific reasons explain these results. First of all, the visual perception system is the most powerful of all the human perception systems. In the human brain, 70% of the receptors and 40% of the cortex are used for the vision process [27,34]. Furthermore, human beings are better at “recognition” tasks than at “memorization” tasks [10]. This implies that textual representations are less efficient than visual metaphors when one wants to analyze huge data-sets. This comes from the fact that reading is both a memorization task and a recognition task.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Auber, D. (2001) Tulip. In: S. Leipert, P. Mutzel, M. Jünger (eds.) Graph Drawing’ 01, Lecture Notes in Computer Science 2265, Springer-Verlag, 335–337

    Google Scholar 

  2. Auber, D. (2002) Outils de visualisation de larges structures de données. PhD thesis, University Bordeaux I

    Google Scholar 

  3. Auber, D. (2002) Using Strahler numbers for real time visual exploration of huge graphs. International Conference on Computer Vision and Graphics, 56–69

    Google Scholar 

  4. Auber, D., Delest, M. (to appear) A clustering algorithm for huge trees. Advances in Applied Mathematics

    Google Scholar 

  5. Bertin, J. (1977) La graphique et le traitement graphique de l’information. Flammarion

    Google Scholar 

  6. Le Blanc, B., Dion, D., Auber, D., Melançon, G. (2001) Constitution et visualisation de deux réseaux d’associations verbales. Colloque Agents Logiciels, Coopération, Apprentissage et Activité Humaine (ALCAA), 37–43

    Google Scholar 

  7. Bruis, D. M., Huizing, C., VanWijk, J. J. (2000) Squarified treemaps. In: Data Visualization 2000, Proceedings of the joint Eurographics and IEEE TCVG Symposium on Visualization, Springer-Verlag, 33–42

    Google Scholar 

  8. Buchheim, C, Jünger, M., Leipert, S. (2000) A fast layout algorithm for k-level graphs. In: J. Marks (ed.) Graph Drawing’ 00, Lecture Notes in Computer Science 1984, Springer-Verlag, 229–240

    Google Scholar 

  9. Carrière, J., Kazman, R. (1995) Interacting with huge hierarchies: Beyond cone trees. In: G. and S. Eick (eds.) IEEE Symposium on Information Visualization, Atlanta, Georgia Institute for Electrical and Electronics Engineers, 74–78

    Google Scholar 

  10. Dix, A., Finlay, J. (1998) Human-Computer Interaction. Prentice-Hall

    Google Scholar 

  11. Ershov, A. P. (1958) On programming of arithmetic operations. Communication of the ACM 1(8), 3–6

    Article  MATH  Google Scholar 

  12. Fairchild, K. M., Poltrock, S. E., Furnas, G. W. (1998) Semnet: Three-dimensional graphic representation of large knowledge bases. In: R. Guindon and L. Erlbaum (eds.) Cognitive Science and its Applications for Human-Computer Interaction, 201–233

    Google Scholar 

  13. Fédou, J. M. (1999) Nombre de Strahler sur les arbres généraux. In: GDR ALP (ed.) Ecole jeunes chercheurs en algorithmique et calcul formel

    Google Scholar 

  14. Frick, A. K., Mehldau, H., Ludwig, A. (1994) A fast adaptive layout algorithm for undirected graphs. In: I. G. Tollis and R. Tamassia (eds.) Graph Drawing’ 94, Lecture Notes in Computer Science 894, Springer-Verlag, 388–403

    Google Scholar 

  15. Gamma, E., Helm, R., Johnson, R., Vlissides, J., Booch, G. (1995) Design Patterns. Addison-Wesley Pub Co

    Google Scholar 

  16. Gärtner, B. (1999) Fast and robust smallest enclosing balls. In: Algorithms-ESA’99: 7th Annual European Symposium Proceedings, Lecture Notes in Computer Science 1643, Springer-Verlag, 325–338

    Google Scholar 

  17. Herman, L, Marshall, M., Melanon, G. (2000) Density functions for visual attributes and effective partitioning in graph visualization. IEEE Symposium on Information Visualization, IEEE Computer Society, 49–56

    Google Scholar 

  18. Hewlett-Packard. Stl standard template library, www.sgi.com/tech/stl/

    Google Scholar 

  19. Kauffman, M., Wagner, D. (2001) Drawing Graphs: Methods and Models. Lecture Notes in Computer Science 2025, Springer-Verlag

    Google Scholar 

  20. Marshall, S. (2001) Methods and tools for the visualization and navigation of graphs. PhD thesis, University Bordeaux I

    Google Scholar 

  21. Marshall, S., Herman, L, Melançon, G. (2001) An object-oriented design for graph visualization. Software — Practice and Experience 31(8), 739–756

    Article  MATH  Google Scholar 

  22. Megiddo, N. (1983) Linear-time algorithms for linear programming in R3 and related problems. SI AM Journal on Computing 12, 759–776

    Article  MathSciNet  MATH  Google Scholar 

  23. Paul, B. The mesa 3-d graphics library, www.mesa3d.org

    Google Scholar 

  24. Reingold, E. M., Tilford, J. S. (1981) Tidier drawings of trees. IEEE Transactions on Software Engineering 7(2), 223–228

    Article  Google Scholar 

  25. Robertson, G. G., Mackinlay, J. D., Card, S. K. (1991) Cone trees: Animated 3d visualizations of hierarchical information. SIGCHI, Conference on Human Factors in Computing Systems, ACM, 189–194

    Google Scholar 

  26. Shneiderman, B. (1996) The eyes have it: A task by data type taxonomy for information visualization. In: Boulder (ed.) IEEE Conference on Visual Languages, 336–343

    Google Scholar 

  27. Spence, R. (2001) Information Visualization. Addison-Wesley

    Google Scholar 

  28. Strahler, A. N. (1952) Hypsomic analysis of erosional topography. Bulletin Geological Society of America 63, 1117–1142

    Article  Google Scholar 

  29. Sugiyama, K., Tagawa, S., Toda, M. (1981) Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics SMC-11(2), 109–125

    Article  MathSciNet  Google Scholar 

  30. Trolltech. Qt the crossplatform C++ gui framework, www.trolltech.com

    Google Scholar 

  31. Tutte, W. T. (1963) How to draw a graph. In: Proceedings of the London Mathematical Society 3(13), 743–768

    Article  MathSciNet  Google Scholar 

  32. Ungar, D., Chambers, C, Chang, B. W., Hölzle, U. (July 1991) Organizing programs without classes. Lisp and Symbolic Computation 4(3), 223–242

    Article  Google Scholar 

  33. Viennot, G. (1990) Trees everywhere. In: A. Arnold (ed.) Colloquium on Trees in Algebra and Programming, Lecture Notes in Computer Science 431, Springer-Verlag, 18–41

    Google Scholar 

  34. Ware, C. (2000) Information Visualization: Perception for design. Interactive Technologies, Moragn Kaufmann

    Google Scholar 

  35. Welzl, E. (1991) Smallest enclosing disks (balls and ellipsoids). In: H. A. Maurer (ed.) New Results and New Trends in Computer Science, Lecture Notes in Computer Science 555, Springer-Verlag

    Google Scholar 

  36. Wills, G. J. (1997) NicheWorks: Interactive visualization of very large graphs. In: G. Di Battista (ed.) Graph Drawing’ 97, Lecture Notes in Computer Science 1353, Springer-Verlag, 403–414

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI-Université Bordeaux 1, 351 Cours de la Libération, 33405, Talence, France

    David Auber

Authors
  1. David Auber
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität zu Köln, Pohligstraße 1, 50969, Köln, Germany

    Michael Jünger

  2. Institut für Computergraphik und Algorithmen, Technische Universität Wien, Favoritenstraße 9-11 E186, 1040, Wien, Austria

    Petra Mutzel

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Auber, D. (2004). Tulip — A Huge Graph Visualization Framework. In: Jünger, M., Mutzel, P. (eds) Graph Drawing Software. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18638-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18638-7_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-62214-4

  • Online ISBN: 978-3-642-18638-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation