Kobourov, Stephen G.
Nishat, Rahnuma Islam
AffiliationUniv Arizona, Dept Comp Sci
MetadataShow full item record
PublisherELSEVIER SCIENCE BV
CitationEvans, W., Felsner, S., Kaufmann, M., Kobourov, S. G., Mondal, D., Nishat, R. I., & Verbeek, K. (2018). Table cartogram. Computational Geometry, 68, 174-185. https://doi.org/10.1016/j.comgeo.2017.06.010
Rights© 2017 Elsevier B.V. All rights reserved.
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at email@example.com.
AbstractA table cartogram of a two dimensional m x 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. (c) 2017 Elsevier B.V. All rights reserved.
Note12 month embargo; published online: 4 July 2017. A preliminary version appeared in the 21st European Symposium on Algorithms (ESA), p. 421-432, 2013.
VersionFinal accepted manuscript