Table cartograms

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

doi:10.1007/978-3-642-40450-4_36

Table cartograms

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

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

11 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 language	English (US)
Title of host publication	Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings
Pages	421-432
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-40450-4_36
State	Published - 2013
Event	21st Annual European Symposium on Algorithms, ESA 2013 - Sophia Antipolis, France Duration: Sep 2 2013 → Sep 4 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8125 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	21st Annual European Symposium on Algorithms, ESA 2013
Country/Territory	France
City	Sophia Antipolis
Period	9/2/13 → 9/4/13

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

Evans, W., Felsner, S., Kaufmann, M., Kobourov, S. G., Mondal, D., Nishat, R. I., & Verbeek, K. (2013). Table cartograms. In Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings (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 et al.
Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings. 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 proceeding › Conference contribution

Evans, W, Felsner, S, Kaufmann, M, Kobourov, SG, Mondal, D, Nishat, RI & Verbeek, K 2013, Table cartograms. in Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings. 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

@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",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "421--432",

booktitle = "Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings",

note = "21st Annual European Symposium on Algorithms, ESA 2013 ; Conference date: 02-09-2013 Through 04-09-2013",

}

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

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

SP - 421

EP - 432

BT - Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings

T2 - 21st Annual European Symposium on Algorithms, ESA 2013

Y2 - 2 September 2013 through 4 September 2013

ER -

Table cartograms

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this