DAGView: An Approach for Visualizing Large Graphs

Kornaropoulos, Evgenios M. and Tollis, Ioannis G. (2013) DAGView: An Approach for Visualizing Large Graphs. In: 20th International Symposium, GD 2012, September 19-21, 2012, Redmond, WA, USA , pp. 499-510 (Official URL: http://link.springer.com/chapter/10.1007/978-3-642-36763-2_44).

Full text not available from this repository.

Abstract

In this paper, we propose a novel visualization framework called DAGView. The aim of DAGView is to produce clear visualizations of directed acyclic graphs in which every edge and the potential existence of a path can be immediately spotted by the user. Several criteria that users identified as important in a layout are met, such as underlying grid, crossings and bends that appear perpendicular. The main algorithm is based on the layout of directed acyclic graphs but can be extended to handle directed graphs with cycles and undirected graphs, taking into account user preferences and/or constraints. Important tasks that are used in user studies are performed efficiently within the DAGView framework.

Item Type:Conference Paper
Additional Information:10.1007/978-3-642-36763-2_44
Classifications:P Styles > P.600 Poly-line > P.600.700 Orthogonal
ID Code:1337

Repository Staff Only: item control page

References

Batagelj, V., Brandenburg, F.J., Didimo, W., Liotta, G., Palladino, P., Patrignani, M.: Visual Analysis of Large Graphs Using (X, Y)-Clustering and Hybrid Visualizations. IEEE Trans. Vis. Comput. Graph. 17(11), 1587–1598 (2011)

Biedl, T., Thiele, T., Wood, D.R.: Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. Algorithmica 44(3), 233–255 (2006)

Binucci, C., Didimo, W., Liotta, G., Nonato, M.: Orthogonal drawings of graphs with vertex and edge labels. Journal Comput. Geom. Theory Appl. 32(2), 71–114 (2005)

Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of graphs. Prentice - Hall, New Jersey (1998)

Di Battista, G., Tamassia, R., Tollis, I.G.: Area Requirement and Symmetry Display of Planar Upward Drawings. Discrete and Comput. Geom. 7(4), 381–401 (1992)

Dwyer, T., Lee, B., Fisher, D., Inkpen Quinn, K., Isenberg, P., Robertson, G.G., North, C.: A Comparison of User-Generated and Automatic Graph Layouts. IEEE Trans. Vis. Comput. Graph. 15(6), 961–968 (2009)

Elmqvist, N., Do, T.-N., Goodell, H., Henry, N., Fekete, J.-D.: ZAME: Interactive Large-Scale Graph Visualization. In: Proc. of IEEE Pacific Vis., pp. 215–222 (2008)

Ghoniem, M., Fekete, J.-D., Castagliola, P.: A Comparison of the Readability of Graphs Using Node-Link and Matrix-Based Representations. In: Proc. of the IEEE Symposium on Information Visualization, pp. 17–24 (2004)

Henry, N., Fekete, J.-D.: MatLink: Enhanced Matrix Visualization for Analyzing Social Networks. In: Baranauskas, C., Abascal, J., Barbosa, S.D.J. (eds.) INTERACT 2007, Part II. LNCS, vol. 4663, pp. 288–302. Springer, Heidelberg (2007)

Henry, N., Fekete, J.-D.: MatrixExplorer: a Dual-Representation System to Explore Social Networks. IEEE Trans. on Visualization and Computer Graphics 12, 677–684 (2006)

Huang, E., Korf, R.E.: New improvements in optimal rectangle packing. In: International Joint Conference on Artificial Intelligence, IJCAI 2009, vol. 6, pp. 511–516 (2009)

Huang, W.: Using eye tracking to investigate graph layout effects. In: Proc. of Int. Asia Pacific Symposium on Visualization, APVIS, pp. 97–100 (2007)

Kornaropoulos, E.M., Tollis, I.G.: Overloaded Orthogonal Drawings. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 242–253. Springer, Heidelberg (2012)

Kornaropoulos, E.M., Tollis, I.G.: Weak Dominance Drawings for Directed Acyclic Graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 566–568. Springer, Heidelberg (2013)

Kornaropoulos, E.M.: Dominance Drawing of Non-Planar Graphs, Masters Thesis, Department of Computer Science, University of Crete (2012)

Papakostas, A., Tollis, I.G.: Efficient Orthogonal Drawings of High Degree Graphs. Algorithmica 26(1), 100–125 (2000)

Papakostas, A., Tollis, I.G.: Algorithms for Area-Efficient Orthogonal Drawings. Computational Geometry Theory and Applications 9(1-2), 83–110 (1998)

Papamanthou, C., Tollis, I.G.: Algorithms for computing a parameterized st-orientation. Theoretical Computer Science 408(2-3), 224–240 (2008)

Purchase, H.C., Hoggan, E., Görg, C.: How Important Is the “Mental Map”? – An Empirical Investigation of a Dynamic Graph Layout Algorithm. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 184–195. Springer, Heidelberg (2007)

Purchase, H.C., Pilcher, C., Plimmer, B.: Graph Drawing Aesthetics-Created by Users, Not Algorithms. IEEE Trans. Vis. Comput. Graph. 18(1), 81–92 (2012)

Purchase, H.C.: Which Aesthetic Has the Greatest Effect on Human Understanding? In: Di Battista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248–261. Springer, Heidelberg (1997)

Purchase, H.C., Cohen, R.F., James, M.I.: An experimental study of the basis for graph drawing algorithms. J. Exp. Algorithmics (JEA) 2(4) (1997)

Tzitzikas, Y., Hainaut, J.L.: On the visualization of large-sized ontologies. In: Proc. of the Workshop on Advanced Visual Interfaces, pp. 99–102 (2006)