This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Flow Map Layout via Spiral Trees
Dec. 2011 (vol. 17 no. 12)
pp. 2536-2544
ASCII Text
x 
 
Kevin Buchin, Bettina Speckmann, Kevin Verbeek, "Flow Map Layout via Spiral Trees," IEEE Transactions on Visualization and Computer Graphics, vol. 17, no. 12, pp. 2536-2544, Dec., 2011.
 
 
BibTex
x
 
@article{ 10.1109/TVCG.2011.202,
author = {Kevin Buchin and Bettina Speckmann and Kevin Verbeek},
title = {Flow Map Layout via Spiral Trees},
journal ={IEEE Transactions on Visualization and Computer Graphics},
volume = {17},
number = {12},
issn = {1077-2626},
year = {2011},
pages = {2536-2544},
doi = {http://doi.ieeecomputersociety.org/10.1109/TVCG.2011.202},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Visualization and Computer Graphics
TI - Flow Map Layout via Spiral Trees
IS - 12
SN - 1077-2626
SP2536
EP2544
EPD - 2536-2544
A1 - Kevin Buchin,
A1 - Bettina Speckmann,
A1 - Kevin Verbeek,
PY - 2011
KW - Flow maps
KW - Automated Cartography
KW - Spiral Trees.
VL - 17
JA - IEEE Transactions on Visualization and Computer Graphics
ER -
 
Kevin Buchin, TU Eindhoven
Bettina Speckmann, TU Eindhoven
Kevin Verbeek, TU Eindhoven
Flow maps are thematic maps that visualize the movement of objects, such as people or goods, between geographic regions. One or more sources are connected to several targets by lines whose thickness corresponds to the amount of flow between a source and a target. Good flow maps reduce visual clutter by merging (bundling) lines smoothly and by avoiding self-intersections. Most flow maps are still drawn by hand and only few automated methods exist. Some of the known algorithms do not support edgebundling and those that do, cannot guarantee crossing-free flows. We present a new algorithmic method that uses edge-bundling and computes crossing-free flows of high visual quality. Our method is based on so-called spiral trees, a novel type of Steiner tree which uses logarithmic spirals. Spiral trees naturally induce a clustering on the targets and smoothly bundle lines. Our flows can also avoid obstacles, such as map features, region outlines, or even the targets. We demonstrate our approach with extensive experiments.

[1] CSISS - Spatial Tools: Tobler's Flow Mapper. http://www.csiss.org/clearinghouseFlowMapper /.
[2] I. Boyandin, E. Bertini, and D. Lalanne, Using flow maps to explore migrations over time. In Proc. Workshop in Geospatial Visual Analytics: Focus on Time (GeoVA(t)), 2010.
[3] K. Buchin, B. Speckmann, and K. Verbeek, Angle-restricted Steiner ar-borescences for flow map layout. In Abstr. 27th European Workshop on Computational Geometry, pages 163–166, 2011.
[4] K. C. Cox, S. G. Eick, and T. He, 3D geographic network displays. SIG-MOD Rec., 25: 50–54, December 1996.
[5] W. Cui, H. Zhou, H. Qu, P. Wong, and X. Li, Geometry-based edge clustering for graph visualization. IEEE Transactions on Visualization and Computer Graphics (INFOVIS 08), 14 (6): 1277–1284, 2008.
[6] B. D. Dent, Cartography: Thematic Map Design. McGraw-Hill, New York, 5th edition, 1999.
[7] C. A. Duncan, A. Efrat, S. G. Kobourov, and C. Wenk, Drawing with fat edges. International Journal of Foundations of Computer Science, 17 (5): 1143–1163, 2006.
[8] A. M. Francis and J. B. Schneider, Using computer graphics to map origin-destination data describing health care delivery systems. Social Science & Medicine, 18 (5): 405–420, 1984.
[9] D. Guo, Flow mapping and multivariate visualization of large spatial interaction data. IEEE Transactions on Visualization and Computer Graphics, 15 (6): 1041–1048, 2009.
[10] D. Holten, Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Transactions on Visualization and Computer Graphics (INFOVIS 06), 12 (5): 741–748, 2006.
[11] D. Holten and J. J. van Wijk, Force-directed edge bundling for graph visualization. Computer Graphics Forum, 28 (3): 983–990, 2009.
[12] F. K. Hwang, D. S. Richards, and P. Winter, The Steiner Tree Problem, volume 53 of Annals of Discrete Mathematics. Elsevier, 1992.
[13] J. Krozel, C. Lee, and J. Mitchell, Turn-constrained route planning for avoiding hazardous weather. Air Traffic Control Quarterly, 14 (2): 159–182, 2006.
[14] D. D. Moran, M. C. Wackernagel, J. A. Kitzes, B. W. Heumann, D. Phan, and S. H. Goldfinger, Trading spaces: Calculating embodied ecological footprints in international trade using a product land use matrix (PLUM). Ecological Economics, 68 (7): 1938–1951, 2009.
[15] T. Munzner, E. Hoffman, K. Claffy, and B. Fenner, Visualizing the global topology of the MBone. In Proc. IEEE Symposium on Information Visualization (INFOVIS '96), pages 85–92, 1996.
[16] D. Phan, L. Xiao, R. Yeh, P. Hanrahan, and T. Winograd, Flow map layout. In Proc. IEEE Symposium on Information Visualization (INFOVIS '05), pages 219–224, 2005.
[17] A. H. Robinson, Early thematic mapping in the history of cartography. University of Chicago Press, 1982.
[18] J.-P. Rodrigue, C. Comtois, and B. Slack, The Geography of Transport Systems. Routledge, New York, 2nd edition, 2009.
[19] A. Simms, D. D. Moran, and P. Chowla, UK Interdependence Report. New Economics Foundation, London, 2006.
[20] T. A. Slocum, R. B. McMaster, F. C. Kessler, and H. H. Howard, Thematic Cartography and Geovisualization. Pearson, New Jersey, 3rd edition, 2010.
[21] D. Stelder, Interregional I-O modelling in Indonesia: a constrained growth rate approach with endogenous investment. Economic Systems Research, 7 (2): 117–135, 1995.
[22] W. Tobler, Experiments in migration mapping by computer. The American Cartographer, 14 (2): 155–163, 1987.
[23] J. Wood, J. Dykes, and A. Slingsby, Visualization of origins, destinations and flows with OD maps. The Cartographic Journal, 47 (2): 117–129, 2010.

Index Terms:
Flow maps, Automated Cartography, Spiral Trees.
Citation:
Kevin Buchin, Bettina Speckmann, Kevin Verbeek, "Flow Map Layout via Spiral Trees," IEEE Transactions on Visualization and Computer Graphics, vol. 17, no. 12, pp. 2536-2544, Dec. 2011, doi:10.1109/TVCG.2011.202
Usage of this product signifies your acceptance of the Terms of Use.