Efficient cartogram generation: A comparison

Proceedings - IEEE Symposium on Information Visualization, INFO VIS

Volumn 2002-January, Issue , 2002, Pages 33-36

  Keim, D A ^a   North, S C ^a   Panse, C ^b   Schneidewind, J ^c  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF KONSTANZ   (Germany)

^c MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

Data structures; Data visualization; Demography; Displays; Humans; Iterative algorithms; Laboratories; Nominations and elections; Shape; Topology

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DATA VISUALIZATION; DISPLAY DEVICES; INFORMATION ANALYSIS; INFORMATION SCIENCE; INFORMATION SYSTEMS; ITERATIVE METHODS; LABORATORIES; TOPOLOGY; VISUALIZATION;

DEMOGRAPHY; HUMANS; ITERATIVE ALGORITHM; NOMINATIONS AND ELECTIONS; SHAPE;

POPULATION STATISTICS;

EID: 84875536984     PISSN: 1522404X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFVIS.2002.1173144     Document Type: Conference Paper

References (8)

1. H. Central. www.multied.com/elections.Mar. 2002.
2. H. Edelsbrunner and R. Waupotitsch. A combinatorial approach to cartograms. Computational Geometry, pages 343-360, 1997.
3. D. A. Keim and A. Herrmann. The gridfit algorithm: An efficient and effective approach to visualizing large amounts of spatial data. IEEE Visualization, Research Triangle Park, NC, pages 181-188, 1998.
4. D. A. Keim, S. C. North, and C. Panse. Cartodraw: A fast algorithm for generating contiguous cartograms. Information Visualization Reseach Group, AT&T Laboratories, Florham Park, 2002.
5. C. J. Kocmoud and D. H. House. Continuous cartogram construction. Proceedings IEEE Visualization, pages 197-204, 1998.
6. K. Mehlhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1st edition, 1999. http://www.mpi-sb.mpg.de/~mehlhorn/LEDAbook.html.
7. W. Tobler. Cartograms and cartosplines. Proceedings of the 1976 Workshop on Automated Cartography and Epidemiology, pages 53-58, 1976.
8. S. Venkatasubramanian. Computing integer cartograms is NP-complete. Technical Report, ATT Research Labs, 2002.