Table cartograms

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 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)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages421-432
Number of pages12
Volume8125 LNCS
DOIs
StatePublished - 2013
Event21st Annual European Symposium on Algorithms, ESA 2013 - Sophia Antipolis, France
Duration: Sep 2 2013Sep 4 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8125 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other21st Annual European Symposium on Algorithms, ESA 2013
CountryFrance
CitySophia Antipolis
Period9/2/139/4/13

Fingerprint

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Evans, W., Felsner, S., Kaufmann, M., Kobourov, S. G., Mondal, D., Nishat, R. I., & Verbeek, K. (2013). Table cartograms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8125 LNCS, pp. 421-432). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8125 LNCS). https://doi.org/10.1007/978-3-642-40450-4_36

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8125 LNCS 2013. p. 421-432 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8125 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Evans, W, Felsner, S, Kaufmann, M, Kobourov, SG, Mondal, D, Nishat, RI & Verbeek, K 2013, Table cartograms. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 8125 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8125 LNCS, pp. 421-432, 21st Annual European Symposium on Algorithms, ESA 2013, Sophia Antipolis, France, 9/2/13. https://doi.org/10.1007/978-3-642-40450-4_36
Evans W, Felsner S, Kaufmann M, Kobourov SG, Mondal D, Nishat RI et al. Table cartograms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8125 LNCS. 2013. p. 421-432. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-40450-4_36
Evans, William ; Felsner, Stefan ; Kaufmann, Michael ; Kobourov, Stephen G ; Mondal, Debajyoti ; Nishat, Rahnuma Islam ; Verbeek, Kevin. / Table cartograms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8125 LNCS 2013. pp. 421-432 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{848c1521d9f247aba9a944e8aabfbfe7,
title = "Table cartograms",
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.",
author = "William Evans and Stefan Felsner and Michael Kaufmann and Kobourov, {Stephen G} and Debajyoti Mondal and Nishat, {Rahnuma Islam} and Kevin Verbeek",
year = "2013",
doi = "10.1007/978-3-642-40450-4_36",
language = "English (US)",
isbn = "9783642404498",
volume = "8125 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "421--432",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Table cartograms

AU - Evans, William

AU - Felsner, Stefan

AU - Kaufmann, Michael

AU - Kobourov, Stephen G

AU - Mondal, Debajyoti

AU - Nishat, Rahnuma Islam

AU - Verbeek, Kevin

PY - 2013

Y1 - 2013

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.

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

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

U2 - 10.1007/978-3-642-40450-4_36

DO - 10.1007/978-3-642-40450-4_36

M3 - Conference contribution

AN - SCOPUS:84884298955

SN - 9783642404498

VL - 8125 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 421

EP - 432

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -