CartoDraw: a fast algorithm for generating contiguous cartograms

@article{Keim2004CartoDrawAF,
  title={CartoDraw: a fast algorithm for generating contiguous cartograms},
  author={Daniel A. Keim and Stephen C. North and Christian Panse},
  journal={IEEE Transactions on Visualization and Computer Graphics},
  year={2004},
  volume={10},
  pages={95-110}
}
Cartograms are a well-known technique for showing geography-related statistical information, such as population demographics and epidemiological data. The basic idea is to distort a map by resizing its regions according to a statistical parameter, but in a way that keeps the map recognizable. We formally define a family of cartogram drawing problems. We show that even simple variants are unsolvable in the general case. Because the feasible variants are NP-complete, heuristics are needed to… 

Visualizing Geographic Information: VisualPoints vs CartoDraw

This paper compares two algorithms that solve the continuous cartogram problem based on the Gridfit technique, which uses pixel-based distortion based on a quadtree-like data structure to make continuous cartograms that strictly retain the topology of the input mesh.

Efficient cartogram generation: a comparison

This work compares two algorithms to solve the problem of making continuous cartograms that strictly retain the topology of the input mesh, which uses pixel-based distortion based on a quadtree-like data structure.

Medial-Axes-based Cartograms

An algorithm is developed which uses an iterative relocation of the vertices based on a modified medial axes transformation of the polygon mesh to solve the continuous cartogram problem which strictly retains the topology of thepolygon mesh.

An Experimental Study of Algorithms for Cartogram Generation

Some quantitative measures that can be used to evaluate how faithfully a cartogram represents the weights, as well as several measures for evaluating the readability of the final representation are defined.

Quantitative Measures for Cartogram Generation Techniques

A set of seven quantitative measures is defined, designed to evaluate how faithfully a cartogram represents the desired weights and to estimate the readability of the final representation.

Quantitative Measures for Cartogram Generation Techniques

A set of seven quantitative measures is defined, designed to evaluate how faithfully a cartogram represents the desired weights and to estimate the readability of the final representation.

Cartograms with Topological Features

The goal is to include topological features such as a river in a Dorling-style or rectangular cartogram to make the visual layout more recognizable, increase map cognition and reduce geospatial error.

A New Algorithm for Continuous Area Cartogram Construction with Triangulation of Regions and Restriction on Bearing Changes of Edges

This study proposes a construction algorithm that involves triangulation of regions and regularization through restrictions on the bearing changes of the edges in order to obtain visually clear results and application to the USA population datasets reveals that the algorithm has mathematical clarity and is user friendly.

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.

A New Construction Method for Circle Cartograms

An area cartogram is a transformed map on which areas of regions are proportional to statistical data values; it is considered to be a powerful tool for the visual representation of statistical data.
...

References

SHOWING 1-10 OF 38 REFERENCES

Continuous cartogram construction

A new algorithm for the construction of continuous area cartograms is presented that was developed by viewing their construction as a constrained optimization problem and uses a relaxation method that exploits hierarchical resolution, constrained dynamics, and a scheme that alternates goals of achieving correct region areas and adjusting region shapes.

Cartography and Geographic Information Systems

GIS technology promises to transform cartography by changing what gets mapped, what form maps take, who makes and uses maps, and how maps are used.

Communication Aspects of Value-by-Area Cartograms

The value-by-area cartogram is a form of mapping often used for its visual impact. The average reaction to cartogram area is potentially error free in that the components of a typical value-by-area

A Note on the Importance of Shape in Cartogram Communication

Abstract Communicating with value-by-area cartograms is at best a difficult task. However, the mapmaker can render a cartogram more meaningful in communication by retaining the basic shapes of the

Area-normalized thematic views

Very expressive nonlinear transformations can be automatically generated to correct thematic maps so that the areas of map regions are proportional to the thematic variables assigned to them.

A combinatorial approach to cartograms

An algorithm is described that constructs homeomorphisms with prescribed area distortion that can be used to generate cartograms, which are geographic maps purposely distorted so its area distribution reflects a variable different from area.

Cartographic transformations and the piezopleth maps method

AbstractNumerous types of anamorphoses, or cartographic transformations, have been perfected, leading to a distorted picture as compared to the usual map representations. Piezopleth maps are a

Human-guided simple search: combining information visualization and heuristic search

The design and implementation of the initial prototype of the heuristic-search and information-visualization techniques in an interactive system for capacitated vehicle routing with time windows (CVRTW), some preliminary results, and the plans for future work are described.

Exploring Large Graphs in 3D Hyperbolic Space

  • T. Munzner
  • Computer Science
    IEEE Computer Graphics and Applications
  • 1998
A software system that explicitly attempts to handle much larger graphs than previous systems and support dynamic exploration rather than final presentation is described and the applicability of this system to goals beyond simple exploration is discussed.