Tulip - A Huge Graph Visualization Framework

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.

[1]  Edward M. Reingold,et al.  Tidier Drawings of Trees , 1981, IEEE Transactions on Software Engineering.

[2]  Craig Chambers,et al.  Organizing programs without classes , 1991, LISP Symb. Comput..

[3]  Ben Shneiderman,et al.  The eyes have it: a task by data type taxonomy for information visualizations , 1996, Proceedings 1996 IEEE Symposium on Visual Languages.

[4]  Ivan Herman,et al.  Density functions for visual attributes and effective partitioning in graph visualization , 2000, IEEE Symposium on Information Visualization 2000. INFOVIS 2000. Proceedings.

[5]  David Auber,et al.  USING STRAHLER NUMBERS FOR REAL TIME VISUAL EXPLORATION OF HUGE GRAPHS , 2002 .

[6]  Jock D. Mackinlay,et al.  Cone Trees: animated 3D visualizations of hierarchical information , 1991, CHI.

[7]  Bernd Gärtner,et al.  Fast and Robust Smallest Enclosing Balls , 1999, ESA.

[8]  Ivan Herman,et al.  An object‐oriented design for graph visualization , 2001, Softw. Pract. Exp..

[9]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[10]  Andrei P. Ershov On programming of arithmetic operations , 1958, CACM.

[11]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  Michael Kaufmann,et al.  Drawing graphs: methods and models , 2001 .

[13]  Andreas Ludwig,et al.  A Fast Adaptive Layout Algorithm for Undirected Graphs , 1994, GD.

[14]  D. Auber,et al.  A clustering algorithm for huge trees , 2003, Adv. Appl. Math..

[15]  Colin Ware,et al.  Information Visualization: Perception for Design , 2000 .

[16]  N. Megiddo Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[17]  A. N. Strahler Hypsometric (area-altitude) analysis of erosional topography. , 1952 .

[18]  J. Bertin La graphique et le traitement graphique de l'information , 1977 .

[19]  W. T. Tutte How to Draw a Graph , 1963 .

[20]  Michael Jünger,et al.  A Fast Layout Algorithm for k-Level Graphs , 2000, Graph Drawing.

[21]  Graham J. Wills,et al.  NicheWorks - Interactive Visualization of Very Large Graphs , 1997, GD.

[22]  Xavier Gérard Viennot,et al.  Trees Everywhere , 1990, CAAP.

[23]  David Auber Outils de visualisation de larges structures de données , 2002 .

[24]  George W. Furnas,et al.  Semnet: three-dimensional graphic representa-tions of large knowledge bases , 1990 .