Table cartograms

W.S. Evans, S. Felsner, M. Kaufmann, S.G. Kobourov, D. Mondal, R.I. Nishat, K.A.B. Verbeek

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

11 Citations (Scopus)


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
Title of host publicationAlgorithms – ESA 2013 (21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings)
EditorsH.L. Bodlaender, G.F. Italiano
Place of PublicationBerlin
ISBN (Print)978-3-642-40449-8
Publication statusPublished - 2013
Externally publishedYes
Event21st Annual European Symposium on Algorithms (ESA 2013) - Sophia Antipolis, France
Duration: 2 Sept 20134 Sept 2013
Conference number: 21st

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Conference21st Annual European Symposium on Algorithms (ESA 2013)
Abbreviated titleESA 2013
CitySophia Antipolis
Internet address


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

Cite this