Abstract
Network analysis is usually performed with combinatorial measures such as those presented in Chap. 5 or traditional statistical tools such as principal component analysis. However, it is extremely difficult for some patterns, even with these powerful approaches, and the results of these methods can be difficult to interpret without an appropriate representation.
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Abello, J., van Ham, F., & Krishnan, N. (2006). Ask-graphview: A large scale graph visualization system. IEEE Transactions on Visualization and Computer Graphics, 12(5), 669–676.
Amiel, M., Rozenblat, C., & Mélançon, G. (2005). Réseaux muti-niveaux: l’exemple des échanges aériens mondiaux de passagers. Mappemonde, 79(3). Retrieved July 21, 2009, from http://mappemonde.mgm.fr/num7/index.html
Archambault, D., Munzner, T., & Auber, D. (2007). Grouse: Feature-based, steerable graph hierarchy exploration. In K. Museth, T. Möller, & A. Ynnerman (Eds.), Eurographics/IEEE-VGTC symposium on visualization (pp. 67–74). Geneva, Switzerland: Eurographics Association.
Archambault, D., Munzner, T., & Auber, D. (2008). Grouseflocks: Steerable exploration of graph hierarchy space. IEEE Transactions on Visualization and Computer Graphics,14(4), 900–913.
Auber, D., Chiricota, Y., Jourdan, F., & Melançon, G. (2003). Multiscale exploration of small world networks. In IEEE symposium on information visualisation (pp. 75–81). Seattle, GA: IEEE Computer Science Press.
Balzer, M., & Deussen, O. (2007). Level-of-detail visualization of clustered graph layouts. In 6th international Asia-Pacific symposium on visualization APVIS’07 (pp. 133–140). Sydney, NSW: IEEE.
Cui, W., Zhou, H., Qu, H., Wong, P. C., & Li, X. (2008). Geometry-based edge clustering for graph visualization. IEEE Transactions on Visualization and Computer Graphics14(6), 1277–1284.
di Battista, G., Eades, P., Tamassia, R., & Tollis, I. G. (1998). Graph drawing: Algorithms for the visualisation of graphs. Englewood Cliffs, NJ: Prentice-Hall.
Dijkstra, E. (1971). Ewd316: A short introduction to the art of programming. Eindhoven, The Netherlands: Technische Hogeschool.
Dongen, S. V. (2000). Graph clustering by flow simulation. PhD thesis, University of Utrecht, The Netherlands.
Eades, P. (1984). A heuristic for graph drawing. Congressus Numerantium,42, 149–160.
Eades, P., & Feng, Q.-W. (1996). Multilevel visualization of clustered graphs. In S. North (Ed.), 4th international symposium on graph drawing (Vol. 1190, pp. 101–112). Berlin, Germany: Springer.
Frick, A., Ludwig, A., & Mehldau, H. (1995). A fast adaptive layout algorithm for undirected graphs. In Symposium on graph drawing GD’94 (Vol. 894, pp. 389–403). London: Springer-Verlag.
Fruchterman, T., & Reingold, E. (1991). Graph drawing by force-directed placement. Software—Practice & Experience,21, 1129–1164.
Gajer, P., Goodrich, M. T., & Kobourov, S. G. (2004). A multi-dimensional approach to force-directed layouts of large graphs. Computational Geometry,29(1), 3–18.
Gajer, P., & Kobourov, S. G. (2002). Grip: Graph drawing with intelligent placement. Journal of Graph Algorithms and Applications,6(3), 203–224.
Gansner, E. R., Koren, Y., & North, S. C. (2005). Topological fisheye views for visualizing large graphs. IEEE Transactions on Visualization and Computer Graphics,11(4), 457–468.
Hachul, S., & Junger, M. (2005). Drawing large graphs with a potential field based multilevel algorithm. In International symposium on graph drawing GD’04 (Vol. 3383, pp. 285–295). New York: Springer-Verlag.
Holten, D. (2006). Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE transactions on visualization and computer graphics (Proceedings of Vis/InfoVis 2006),12(5), 741–748.
Holten, D., & Wijk, J. J. V. (2009). Force-directed edge bundling for graph visualization. Computer Graphics Forum,28(3), 983–990.
Huang, M. L., & Eades, P. (1999). A fully animated interactive system for clustering and navigating huge graphs. In S. H. Whitesides (Ed.), Symposium on graph drawing GD’98 (Vol. 1547, pp. 374–383). Montréal, Canada: Springer.
Kamada, T., & Kawai, S. (1989). An algorithm for drawing general undirected graphs. Information Processing Letters,31, 7–15.
Lambert, A., Bourqui, R., & Auber, D. (2010). Winding roads: Routing edges into bundles. Computer Graphics Forum,29(3), 853–862.
Lauther, U. (2007). Multipole-based force approximation revisited—A simple but fast implementation using a dynamized enclosing-circle-enhanced k-d-tree. In M. Kaufmann & D. Wagner (Eds.), Graph drawing (Vol. 4372, pp. 20–29). Berlin, Germany: Springer.
Liere, R. V., & Leeuw, W. D. (2003). Graphsplatting: Visualizing graphs as continuous fields. IEEE Transactions on Visualization and Computer Graphics,9(2), 206–212.
McSherry, F. (2004). Spectral methods for the data analysis. PhD thesis, University of Washington, Seattle, WA.
Newman, M. E. J., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physics Reviews E,69, 026113.
Phan, D., Ling, X., Yeh, R., & Hanrahan, P. (2005). Flow map layout. In IEEE symposium on information visualization (pp. 219–224).
Purchase, H. (1998). Which aesthetic has the greatest effect on human understanding?. In Symposium on graph drawing GD’97 (Vol. 1353, pp. 248–261). Rome, Italy: Springer-Verlag.
Purchase, H., Cohen, R. F., & James, M. (1995). Validating graph drawing aesthetics. In Symposium graph drawing GD’95 (Vol. 1027, p. 435–446). Passau, Germany: Springer.
Schaeffer, S. E. (2005). Stochastic local clustering for massive graphs. In T. Ho, D. Cheung, & H. Liu (Eds.), Advances in knowledge discovery and data mining (Vol. 3518, pp. 413–424). Berlin, Germany: Springer.
Schaffer, D., Zuo, Z., Greenberg, S., Bartram, L., Dill, J., Dubs, S., et al. (1996). Navigating hierarchically clustered networks through fisheye and full-zoom methods. ACM Transactions on Computer-Human Interaction,3(2), 162–188.
van Ham, F., & van Wijk, J. J. (2004). Interactive visualization of small world graphs. In T. Munzner & M. Ward (Eds.), IEEE symposium on information visualisation (pp. 199–206). Seattle, GA: IEEE Computer Science Press.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Lambert, A., Bourqui, R., Auber, D. (2013). Graph Visualization For Geography. In: Rozenblat, C., Melançon, G. (eds) Methods for Multilevel Analysis and Visualisation of Geographical Networks. Methodos Series, vol 11. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-6677-8_6
Download citation
DOI: https://doi.org/10.1007/978-94-007-6677-8_6
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-6676-1
Online ISBN: 978-94-007-6677-8
eBook Packages: Humanities, Social Sciences and LawSocial Sciences (R0)