Table cartogram

William Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek

Research output: Contribution to journalArticle

3 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)174-185
Number of pages12
JournalComputational Geometry: Theory and Applications
Volume68
DOIs
StatePublished - Mar 2018

Keywords

  • Cartogram
  • Data visualization
  • Grid map
  • Tree map

ASJC Scopus subject areas

  • Computer Science Applications
  • Geometry and Topology
  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Table cartogram'. Together they form a unique fingerprint.

  • Cite this

    Evans, W., Felsner, S., Kaufmann, M., Kobourov, S. G., Mondal, D., Nishat, R. I., & Verbeek, K. (2018). Table cartogram. Computational Geometry: Theory and Applications, 68, 174-185. https://doi.org/10.1016/j.comgeo.2017.06.010