Table cartogram

DOI10.1016/J.COMGEO.2017.06.010MaRDI QIDQ1699289zbMATH OpenOpenAlexFDO

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

Publication date 19 February 2018

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10150/628276

zbMATH Keywords

cartogramdata visualizationgrid maptree map

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Review text

Let be given an \(m\times n\) rectangular grid with positive weight values in every cell. A cartogram is the result of resizing the rectangular cells into quadrilaterals, respecting adjacency, in such a way that their size reflects the weight they contain. Since the solution is not unique, visual improvements can be proposed. An algorithm of complexity \(O(mn)\) is presented and it is proved that it generates a cartogram with convex cells. The algorithm uses triangles (considered to be degenerate quadrangles) and then a technique to remove the degeneracy. In a second part, generalizations are proposed using a quadrilateral grid in a general convex quadrilateral, or a circle, or a cartogram on a sphere. The underlying idea is that cartograms might be interesting for presenting data related to geographic regions.

Recommendations

• Table cartograms
• On rectangular cartograms
• Algorithms – ESA 2004
• Computing cartograms with optimal complexity
• Optimal BSPs and rectilinear cartograms

Cites work

• A combinatorial approach to cartograms.
• Area-universal and constrained rectangular layouts
• Computing cartograms with optimal complexity
• Diffusion-based method for producing density-equalizing maps
• Drawing planar 3-trees with given face areas
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• scientific article; zbMATH DE number 3289061 (Why is no real title available?)
• Improved Grid Map Layout by Point Set Matching
• On rectangular cartograms
• On rectilinear duals for vertex-weighted plane graphs
• Portraits of the Earth
• Proportional Contact Representations of Planar Graphs
• Table cartograms

Cited in

(12)

• On the area-universality of triangulations
• StreamTable: an area proportional visualization for tables with flowing streams
• A combinatorial approach to cartograms.
• Table cartograms
• Optimal BSPs and rectilinear cartograms
• Fast flow-based algorithm for creating density-equalizing map projections
• Diffusion-based method for producing density-equalizing maps
• Algorithms – ESA 2004
• On area-universal quadrangulations
• Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
• StreamTable: an area proportional visualization for tables with flowing streams
• On rectangular cartograms

Describes a project that uses

Uses Software

• CartoDraw

This page was built for publication: Table cartogram

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699289)