### 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 language | English |
---|---|

Pages (from-to) | 174-185 |

Number of pages | 12 |

Journal | Computational Geometry |

Volume | 68 |

DOIs | |

Publication status | Published - 2018 |

### Fingerprint

### Keywords

- Cartogram
- Data visualization
- Grid map
- Tree map

### Cite this

*Computational Geometry*,

*68*, 174-185. https://doi.org/10.1016/j.comgeo.2017.06.010

}

*Computational Geometry*, vol. 68, pp. 174-185. https://doi.org/10.1016/j.comgeo.2017.06.010

**Table cartogram.** / Evans, W.; Felsner, S.; Kaufmann, M.; Kobourov, S.G.; Mondal, D.; Nishat, R.I.; Verbeek, K.A.B.

Research output: Contribution to journal › Article › Academic › peer-review

TY - JOUR

T1 - Table cartogram

AU - Evans, W.

AU - Felsner, S.

AU - Kaufmann, M.

AU - Kobourov, S.G.

AU - Mondal, D.

AU - Nishat, R.I.

AU - Verbeek, K.A.B.

PY - 2018

Y1 - 2018

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

U2 - 10.1016/j.comgeo.2017.06.010

DO - 10.1016/j.comgeo.2017.06.010

M3 - Article

AN - SCOPUS:85021883604

VL - 68

SP - 174

EP - 185

JO - Computational Geometry

JF - Computational Geometry

SN - 0925-7721

ER -