# RecMap: Rectangular Map Approximations

@article{Heilmann2004RecMapRM, title={RecMap: Rectangular Map Approximations}, author={Roland Heilmann and Daniel A. Keim and Christian Panse and Mike Sips}, journal={IEEE Symposium on Information Visualization}, year={2004}, pages={33-40} }

In many application domains, data is collected and referenced by its geospatial location. Nowadays, different kinds of maps are used to emphasize the spatial distribution of one or more geospatial attributes. The nature of geospatial statistical data is the highly nonuniform distribution in the real world data sets. This has several impacts on the resulting map visualizations. Classical area maps tend to highlight patterns in large areas, which may, however, be of low importance. Cartographers…

## 92 Citations

### Visualization of Geo-spatial Point Sets via Global Shape Transformation and Local Pixel Placement

- Computer ScienceIEEE Transactions on Visualization and Computer Graphics
- 2006

A framework that allows the user to specify a global shape function and a local placement function for cartogram-based layout and PixelMaps is presented, obtaining some of the benefits of each toward improved exploration of dense geo-spatial data sets.

### Density Equalizing Distortion of Large Geographic Point Sets

- Computer Science
- 2009

Two new approaches (RadialScale and AngularScale) are introduced to create density-equalized maps, while preserving recognizable features and neighborhoods in the visualization to build a more appropriate basis for analytic purposes.

### Algorithms for cartographic visualization

- Computer Science
- 2012

An efficient algorithm to compute a collection of non-crossing paths with fixed orientations using as few links as possible is developed, which approximates the optimal solution to within a factor that depends only on the number of allowed orientations.

### Necklace Maps

- Computer ScienceIEEE Transactions on Visualization and Computer Graphics
- 2010

An automated approach to generate necklace maps which allows the user to interactively control the final symbol placement is presented, and the approach is validated with experiments using various data sets and maps.

### Fast flow-based algorithm for creating density-equalizing map projections

- Computer ScienceProceedings of the National Academy of Sciences
- 2018

A flow-based algorithm whose equations of motion are numerically easier to solve compared with previous methods is introduced, allowing straightforward parallelization so that the calculation takes only a few seconds even for complex and detailed input.

### Cartograms with Topological Features

- Computer ScienceCGVC
- 2018

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.

### The State of the Art in Map‐Like Visualization

- Computer ScienceComput. Graph. Forum
- 2020

An overview of the literature on map‐like visualization is given and a hierarchical classification of existing techniques along two general perspectives is provided: imitation and schematization of cartographic maps.

### The State of the Art in Cartograms

- Computer ScienceComput. Graph. Forum
- 2016

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.

### Visualization of Hierarchies in Space and Time

- Computer Science
- 2010

By combining various well-established concepts, a reasonably complete visualization of all of the aforementioned aspects of spatio-temporal visualization is achieved, where the focus is on hierarchical structures.

### Visualizing Cartograms: Goals and Task Taxonomy

- Computer ScienceArXiv
- 2015

A set of cartogram visualization tasks, based on standard taxonomies from cartography and information visualization, are considered, and a cartogram task taxonomy is proposed that can be used to organize not only the tasks considered here but also other tasks that might be added later.

## References

SHOWING 1-10 OF 13 REFERENCES

### Cartographic visualization: exploratory spatial data analysis with local indicators of spatial association using Tcl/Tk and cdv

- Computer Science
- 1998

This introduction to the software and approach outlines some of the rationale behind the development and contains an overview of the cartographic and statistical ESDA functionality.

### CartoDraw: a fast algorithm for generating contiguous cartograms

- Computer ScienceIEEE Transactions on Visualization and Computer Graphics
- 2004

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.

### Continuous cartogram construction

- Computer ScienceProceedings Visualization '98 (Cat. No.98CB36276)
- 1998

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.

### Efficient cartogram generation: a comparison

- Computer ScienceIEEE Symposium on Information Visualization, 2002. INFOVIS 2002.
- 2002

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.

### On rectangular cartograms

- Computer ScienceComput. Geom.
- 2004

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.

### Tree-maps: a space-filling approach to the visualization of hierarchical information structures

- Computer ScienceProceeding Visualization '91
- 1991

The tree-map visualization technique makes 100% use of the available display space, mapping the full hierarchy onto a rectangular region in a space-filling manner, which allows very large hierarchies to be displayed in their entirety and facilitates the presentation of semantic information.

### Graph Theory with Applications

- Mathematics
- 1977

The burgeoning of Graph Theory was first aware when I studied the 1940 paper of Brooks, Smith, Stone and Tutte in the Duke Mathematical Journal, ostensibly on squared rectangles, all in the Quest of the Perfect Square.

### Genetic algorithms and engineering optimization

- Computer Science
- 1999

This paper presents a meta-modelling framework that automates the very labor-intensive and therefore time-heavy and therefore expensive and labor-heavy process of designing and solving optimization problems.

### The New York Times on the Web. The 2000 election

- The New York Times on the Web. The 2000 election
- 2004