Table cartogram

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

Research output: Contribution to journalArticle

2 Citations (Scopus)

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)
JournalComputational Geometry: Theory and Applications
DOIs
StateAccepted/In press - 2017

Fingerprint

Table
Rectangle
Cell
Partition
Face
Adjacency
Circle
Non-negative
Generalise
Arbitrary

Keywords

  • Cartogram
  • Data visualization
  • Grid map
  • Tree map

ASJC Scopus subject areas

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

Cite this

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

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

In: Computational Geometry: Theory and Applications, 2017.

Research output: Contribution to journalArticle

Evans, W, Felsner, S, Kaufmann, M, Kobourov, SG, Mondal, D, Nishat, RI & Verbeek, K 2017, 'Table cartogram', Computational Geometry: Theory and Applications. https://doi.org/10.1016/j.comgeo.2017.06.010
Evans, William ; Felsner, Stefan ; Kaufmann, Michael ; Kobourov, Stephen G ; Mondal, Debajyoti ; Nishat, Rahnuma Islam ; Verbeek, Kevin. / Table cartogram. In: Computational Geometry: Theory and Applications. 2017.
@article{085b39e68bc342bf8f1420e7291527e4,
title = "Table cartogram",
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.",
keywords = "Cartogram, Data visualization, Grid map, Tree map",
author = "William Evans and Stefan Felsner and Michael Kaufmann and Kobourov, {Stephen G} and Debajyoti Mondal and Nishat, {Rahnuma Islam} and Kevin Verbeek",
year = "2017",
doi = "10.1016/j.comgeo.2017.06.010",
language = "English (US)",
journal = "Computational Geometry: Theory and Applications",
issn = "0925-7721",
publisher = "Elsevier",

}

TY - JOUR

T1 - Table cartogram

AU - Evans, William

AU - Felsner, Stefan

AU - Kaufmann, Michael

AU - Kobourov, Stephen G

AU - Mondal, Debajyoti

AU - Nishat, Rahnuma Islam

AU - Verbeek, Kevin

PY - 2017

Y1 - 2017

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

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

KW - Cartogram

KW - Data visualization

KW - Grid map

KW - Tree map

UR - http://www.scopus.com/inward/record.url?scp=85021883604&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85021883604&partnerID=8YFLogxK

U2 - 10.1016/j.comgeo.2017.06.010

DO - 10.1016/j.comgeo.2017.06.010

M3 - Article

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

SN - 0925-7721

ER -