Skip to main content
SpringerLink
Log in

Graph Visualization For Geography

  • Chapter
  • First Online:
Methods for Multilevel Analysis and Visualisation of Geographical Networks

Part of the book series: Methodos Series ((METH,volume 11))

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.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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

References

  • 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.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Chapter  Google Scholar 

  • 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.

    Google Scholar 

  • di Battista, G., Eades, P., Tamassia, R., & Tollis, I. G. (1998). Graph drawing: Algorithms for the visualisation of graphs. Englewood Cliffs, NJ: Prentice-Hall.

    Google Scholar 

  • Dijkstra, E. (1971). Ewd316: A short introduction to the art of programming. Eindhoven, The Netherlands: Technische Hogeschool.

    Google Scholar 

  • Dongen, S. V. (2000). Graph clustering by flow simulation. PhD thesis, University of Utrecht, The Netherlands.

    Google Scholar 

  • Eades, P. (1984). A heuristic for graph drawing. Congressus Numerantium,42, 149–160.

    Google Scholar 

  • 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.

    Chapter  Google Scholar 

  • 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.

    Google Scholar 

  • Fruchterman, T., & Reingold, E. (1991). Graph drawing by force-directed placement. Software—Practice & Experience,21, 1129–1164.

    Google Scholar 

  • 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.

    Google Scholar 

  • Gajer, P., & Kobourov, S. G. (2002). Grip: Graph drawing with intelligent placement. Journal of Graph Algorithms and Applications,6(3), 203–224.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Holten, D., & Wijk, J. J. V. (2009). Force-directed edge bundling for graph visualization. Computer Graphics Forum,28(3), 983–990.

    Google Scholar 

  • 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.

    Chapter  Google Scholar 

  • Kamada, T., & Kawai, S. (1989). An algorithm for drawing general undirected graphs. Information Processing Letters,31, 7–15.

    Google Scholar 

  • Lambert, A., Bourqui, R., & Auber, D. (2010). Winding roads: Routing edges into bundles. Computer Graphics Forum,29(3), 853–862.

    Google Scholar 

  • 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.

    Chapter  Google Scholar 

  • Liere, R. V., & Leeuw, W. D. (2003). Graphsplatting: Visualizing graphs as continuous fields. IEEE Transactions on Visualization and Computer Graphics,9(2), 206–212.

    Google Scholar 

  • McSherry, F. (2004). Spectral methods for the data analysis. PhD thesis, University of Washington, Seattle, WA.

    Google Scholar 

  • Newman, M. E. J., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physics Reviews E,69, 026113.

    Google Scholar 

  • Phan, D., Ling, X., Yeh, R., & Hanrahan, P. (2005). Flow map layout. In IEEE symposium on information visualization (pp. 219–224).

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Chapter  Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS UMR 5800 LaBRI, Université Bordeaux 1 – GRAVITE INRIA Sud-Ouest, 33405, Talence Cedex, France

    Antoine Lambert, Romain Bourqui & David Auber

Authors
  1. Antoine Lambert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Romain Bourqui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David Auber
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Antoine Lambert .

Editor information

Editors and Affiliations

  1. , Institute of Geography, University of Lausanne, Geopolis, Lausanne, 1015, Switzerland

    Céline Rozenblat

  2. , LABRI, University of Bordeaux 1, Cours de Libération 351, Talence cedex, 33405, France

    Guy Melançon

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation