Mosaic Drawings and Cartograms

@article{Cano2015MosaicDA,
  title={Mosaic Drawings and Cartograms},
  author={Rafael G. Cano and Kevin Buchin and Thom Castermans and Antonie Pieterse and Willem Sonke and Bettina Speckmann},
  journal={Computer Graphics Forum},
  year={2015},
  volume={34}
}
Cartograms visualize quantitative data about a set of regions such as countries or states. There are several different types of cartograms and – for some – algorithms to automatically construct them exist. We focus on mosaic cartograms: cartograms that use multiples of simple tiles – usually squares or hexagons – to represent regions. Mosaic cartograms communicate well data that consist of, or can be cast into, small integer units (for example, electorial college votes). In addition, they allow… 

Multicriteria Optimization for Dynamic Demers Cartograms

This work presents a method to compute stable stable Demers cartograms, where each region is shown as a square scaled proportionally to the given numerical data and similar data yield similar cartograms.

The State of the Art in Cartograms

This work surveys cartogram research in visualization, cartography and geometry, covering a broad spectrum of different cartogram types: from the traditional rectangular and table cartograms, to Dorling and diffusion cartograms.

Cartogram Visualization for Bivariate Geo-Statistical Data

Bivariate cartograms make it easy to find more geographic patterns and outliers in a pre-attentive way than previous approaches, and are most effective for showing two variables from the same domain, although they can also be used for variables from different domains.

Task-Based Effectiveness of Interactive Contiguous Area Cartograms

This study suggests that interactivity has the potential to make contiguous cartograms accessible even for those readers who are unfamiliar with interactive computer graphics or do not have a prior affinity to working with maps.

Evaluating Cartogram Effectiveness

This work evaluates four major types of cartograms: contiguous, non-contiguous, rectangular, and Dorling cartograms based on a recent task taxonomy for cartograms.

EVALUATING CARTOGRAM EFFECTIVENESS 2 In 1975 Dent

This work evaluates four major types of cartograms: contiguous, non-contiguous, rectangular, and Dorling cartograms based on a recent task taxonomy for cartograms.

Putting Table Cartograms into Practice

It is shown that large table cartograms may provide diagrammatic representations in various real-life scenarios, e.g., for analyzing correlations between geospatial variables and creating visual effects in images.

Discretized Approaches to Schematization

This paper explores discretized approaches to computing a schematic shape for a simple polygon by overlaying a plane graph on $P$ as the solution space for the schematic shape, and proves that it is NP-hard to compute the optimal face set.

Computing Fast and Scalable Table Cartograms for Large Tables

An empirical comparison among these three table cartogram techniques with two different real-life datasets: a meteorological weather dataset and a US State-to-State migration flow dataset shows that FastFlow and TCarto both performed well on the weather data table, however, for US State to State migration flow data, FastFlow generated concave quadrilateral faces.

Effectiveness of Area-to-Value Legends and Grid Lines in Contiguous Area Cartograms

This experiment investigated whether including an area-to-value legend (in the form of a square symbol next to the value represented by the square’s area) makes it easier for map readers to estimate magnitudes and recommended considering the cartogram’'s use case and purpose before deciding whether to include grid lines or an interactive legend.

References

SHOWING 1-10 OF 27 REFERENCES

On rectangular cartograms

The first algorithms for rectangular cartogram construction are presented and a non-trivial class of rectangular subdivisions for which exact cartograms can be efficiently computed is characterized.

Optimal BSPs and rectilinear cartograms

An algorithm for constructing rectilinear cartograms with zero cartographic error and correct region adjacencies is presented, and this algorithm works for a general class of optimality criteria, including size and depth.

Evolution Strategies for Optimizing Rectangular Cartograms

This paper employs evolution strategies that find rectangular duals which can be used for rectangular cartograms with correct adjacencies and (close to) zero cartographic error, a considerable improvement upon previous methods that have to either relax adjacency requirements or deal with larger errors.

A Linear Programming Approach to Rectangular Cartograms

This paper presents a new approach to the second step of rectangular cartograms based on alternatingly solving linear programs on the x-coordinates and the y-coordinate of the sides of the rectangles.

CartoDraw: a fast algorithm for generating contiguous cartograms

An efficient iterative scanline algorithm to reposition edges while preserving local and global shapes and a shape similarity function, which is based on a Fourier transformation of the polygons' curvatures are proposed.

Hexagon Mosaic Maps for Display of Univariate and Bivariate Geographical Data

This paper presents concepts that motivate the use of hexagon mosaic maps and hexagon-based ray-glyph maps. The phrase "hexagon mosaic map" refers to maps that use hexagons to tessellate major areas

Computing Cartograms with Optimal Complexity

It is proved that even for Hamiltonian graphs 8-sided rectilinear polygons are necessary, by constructing a non-trivial lower bound example, which means that there are optimal representations (in terms of both polygonal complexity and running time) forHamiltonian maximal planar and maximal outer-planar graphs.

AN ALGORITHM TO CONSTRUCT CONTINUOUS AREA CARTOGRAMS

A computer algorithm is presented which can handle more realistic descriptions of polygon boundaries than previous algorithms and manual methods, thus enhancing visual recognition.

Spatially Ordered Treemaps

  • J. WoodJ. Dykes
  • Computer Science
    IEEE Transactions on Visualization and Computer Graphics
  • 2008
This work proposes extensions to the existing squarified layout algorithm that exploit the two-dimensional arrangement of treemap nodes more effectively and provides a more consistent arrangement of nodes while maintaining low aspect ratios.

The Rectangular Statistical Cartogram

T HE idea of the statistical cartogram occurred to the author when he had occasion to prepare maps of the United States showing the distribution of various economic units, such as steel factories,