Abstract
A table cartogram of a two dimensional m ×n table A of non-negative weights in a rectangle R, whose area equals the sum of the weights, is a partition of R into convex quadrilateral faces corresponding to the cells of A such that each face has the same adjacency as its corresponding cell and has area equal to the cell’s weight. Such a partition acts as a natural way to visualize table data arising in various fields of research. In this paper, we give a O(mn)-time algorithm to find a table cartogram in a rectangle. We then generalize our algorithm to obtain table cartograms inside arbitrary convex quadrangles, circles, and finally, on the surface of cylinders and spheres.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Raisz, E.: The rectangular statistical cartogram. Geographical Review 24(2), 292–296 (1934)
van Kreveld, M., Speckmann, B.: On rectangular cartograms. Comput. Geom. Theory Appl. 37(3), 175–187 (2007)
Heilmann, R., Keim, D.A., Panse, C., Sips, M.: Recmap: Rectangular map approximations. In: Proc. of InfoVis 2004, pp. 33–40 (2004)
Wood, J., Dykes, J.: Spatially ordered treemaps. IEEE Transactions on Visualization and Computer Graphics 14(6), 1348–1355 (2008)
Eppstein, D., van Kreveld, M., Speckmann, B., Staals, F.: Improved grid map layout by point set matching. In: Proc. of PacificVis 2013 (to appear, 2013)
Eppstein, D., Mumford, E., Speckmann, B., Verbeek, K.: Area-universal rectangular layouts. In: SoCG 2009, pp. 267–276. ACM (2009)
de Berg, M., Mumford, E., Speckmann, B.: On rectilinear duals for vertex-weighted plane graphs. Discrete Mathematics 309(7), 1794–1812 (2009)
Alam, M.J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S.G., Ueckerdt, T.: Computing cartograms with optimal complexity. In: SoCG 2012, pp. 21–30 (2012)
Yeap, K.H., Sarrafzadeh, M.: Floor-planning by graph dualization: 2-concave rectilinear modules. SIAM J. Comput. 22(3), 500–526 (1993)
Alam, M.J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S.G.: Proportional contact representations of planar graphs. Journal of Graph Algorithms and Applications 16(3), 701–728 (2012)
Dougenik, J.A., Chrisman, N.R., Niemeyer, D.R.: An algorithm to construct continuous area cartograms. The Professional Geographer 37(1), 75–81 (1985)
Dorling, D.: Area cartograms: their use and creation. Number 59 in Concepts and Techniques in Modern Geography. University of East Anglia (1996)
Keim, D.A., North, S.C., Panse, C.: Cartodraw: A fast algorithm for generating contiguous cartograms. IEEE Trans. Vis. Comput. Graph. 10(1), 95–110 (2004)
Gastner, M.T., Newman, M.E.J.: Diffusion-based method for producing density-equalizing maps. National Academy of Sciences 101(20), 7499–7504 (2004)
Edelsbrunner, H., Waupotitsch, R.: A combinatorial approach to cartograms. Computational Geometry: Theory and Applications 7(5-6), 343–360 (1997)
House, D.H., Kocmoud, C.J.: Continuous cartogram construction. In: Proc. of VIS 1998, pp. 197–204 (1998)
Tobler, W.: Thirty five years of computer cartograms. Annals Assoc. American Geographers 94(1), 58–73 (2004)
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
Evans, W. et al. (2013). Table Cartograms. In: Bodlaender, H.L., Italiano, G.F. (eds) Algorithms – ESA 2013. ESA 2013. Lecture Notes in Computer Science, vol 8125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40450-4_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-40450-4_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40449-8
Online ISBN: 978-3-642-40450-4
eBook Packages: Computer ScienceComputer Science (R0)