A combinatorial approach to cartograms
Computational Geometry: Theory and Applications
Continuous cartogram construction
Proceedings of the conference on Visualization '98
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Human-guided simple search: combining information visualization and heuristic search
Proceedings of the 1999 workshop on new paradigms in information visualization and manipulation in conjunction with the eighth ACM internation conference on Information and knowledge management
Exploring Large Graphs in 3D Hyperbolic Space
IEEE Computer Graphics and Applications
Using extended feature objects for partial similarity retrieval
The VLDB Journal — The International Journal on Very Large Data Bases
Nonlinear Magnification Fields
INFOVIS '97 Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97)
Visualizing geographic information: VisualPoints vs CartoDraw
Information Visualization
Visual Data Mining in Large Geospatial Point Sets
IEEE Computer Graphics and Applications
Rectangular cartograms: construction & animation
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
IEEE Computer Graphics and Applications
Optimal BSPs and rectilinear cartograms
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Visualization of Geo-spatial Point Sets via Global Shape Transformation and Local Pixel Placement
IEEE Transactions on Visualization and Computer Graphics
Computational Geometry: Theory and Applications
Topological Landscapes: A Terrain Metaphor for Scientific Data
IEEE Transactions on Visualization and Computer Graphics
Carto-SOM: cartogram creation using self-organizing maps
International Journal of Geographical Information Science
Time-Space maps from triangulations
GD'12 Proceedings of the 20th international conference on Graph Drawing
Neighborhood relation diagrams for local comparison of carbon footprints in urban planning
Information Visualization
Hi-index | 0.00 |
Abstract- 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. In this study, 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 solve the problem. Previously proposed solutions suffer from problems with the quality of the generated drawings. For a cartogram to be recognizable, it is important to preserve the global shape or outline of the input map, a requirement that has been overlooked in the past. To address this, our objective function for cartogram drawing includes both global and local shape preservation. To measure the degree of shape preservation, we propose a shape similarity function, which is based on a Fourier transformation of the polygons' curvatures. Also, our application is visualization of dynamic data, for which we need an algorithm that recalculates a cartogram in a few seconds. None of the previous algorithms provides adequate performance with an acceptable level of quality for this application. In this paper, we therefore propose an efficient iterative scanline algorithm to reposition edges while preserving local and global shapes. Scanlines may be generated automatically or entered interactively to guide the optimization process more closely. We apply our algorithm to several example data sets and provide a detailed comparison of the two variants of our algorithm and previous approaches.