Indroduction
Large graphs appear in many application domains. Their analysis can be done automatically by machines, for which the graph size is less of a problem, or, especially for exploration tasks, visually by humans. The graph drawing literature contains many efficient methods for visualizing large graphs, see e.g. [4, Chapter 12], but for large graphs it is often useful to first compute a sequence of coarser and more abstract representations by grouping vertices recursively using a hierarchical clustering algorithm. Then the task is to compute an overview picture of the graph based on a given cluster hierarchy, such that details of the graph, e.g., within clusters, remain visible on demand.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bourqui, R., Auber, D., Mary, P.: How to draw clustered weighted graphs using a multilevel force-directed graph drawing algorithm. In: Proc. 11th Int’l Conf. Inform. Vis., IV 2007, pp. 757–764. IEEE (2007), doi:10.1109/IV.2007.65
Didimo, W., Montecchiani, F.: Fast layout computation of hierarchically clustered networks: Algorithmic advances and experimental analysis. In: Proc. 16th Int’l Conf. Inform. Vis., IV 2012, pp. 18–23. IEEE (2012) doi:10.1109/IV.2012.14
Fabrikant, S.I., Montello, D.R., Mark, D.M.: The natural landscape metaphor in information visualization: The role of commonsense geomorphology. J. Am. Soc. Inform. Sci. and Technol. 61(2), 253–270 (2010), doi:10.1002/asi.21227
Tamassia, R. (ed.): Handbook of Graph Drawing and Visualization. CRC Press (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Athenstädt, J.C., Görke, R., Krug, M., Nöllenburg, M. (2013). Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor. In: Didimo, W., Patrignani, M. (eds) Graph Drawing. GD 2012. Lecture Notes in Computer Science, vol 7704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36763-2_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-36763-2_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36762-5
Online ISBN: 978-3-642-36763-2
eBook Packages: Computer ScienceComputer Science (R0)