Show simple item record

dc.contributor.authorEvans, William*
dc.contributor.authorFelsner, Stefan*
dc.contributor.authorKaufmann, Michael*
dc.contributor.authorKobourov, Stephen G.*
dc.contributor.authorMondal, Debajyoti*
dc.contributor.authorNishat, Rahnuma Islam*
dc.contributor.authorVerbeek, Kevin*
dc.date.accessioned2018-07-23T22:25:57Z
dc.date.available2018-07-23T22:25:57Z
dc.date.issued2018-03
dc.identifier.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.010en_US
dc.identifier.issn09257721
dc.identifier.doi10.1016/j.comgeo.2017.06.010
dc.identifier.urihttp://hdl.handle.net/10150/628276
dc.description.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.en_US
dc.language.isoenen_US
dc.publisherELSEVIER SCIENCE BVen_US
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S0925772117300627en_US
dc.rights© 2017 Elsevier B.V. All rights reserved.en_US
dc.subjectCartogramen_US
dc.subjectData visualizationen_US
dc.subjectGrid mapen_US
dc.subjectTree mapen_US
dc.titleTable cartogramen_US
dc.typeArticleen_US
dc.contributor.departmentUniv Arizona, Dept Comp Scien_US
dc.identifier.journalCOMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONSen_US
dc.description.note12 month embargo; published online: 4 July 2017. A preliminary version appeared in the 21st European Symposium on Algorithms (ESA), p. 421-432, 2013.en_US
dc.description.collectioninformationThis 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 repository@u.library.arizona.edu.en_US
dc.eprint.versionFinal accepted manuscripten_US
dc.source.journaltitleComputational Geometry
dc.source.volume68
dc.source.beginpage174
dc.source.endpage185
refterms.dateFOA2018-07-04T00:00:00Z


Files in this item

Thumbnail
Name:
table-cartogram-esa13.pdf
Size:
226.9Kb
Format:
PDF
Description:
Final Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record