Complexity of octagonal and rectangular cartograms

Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG 2005

Volumn , Issue , 2005, Pages 117-120

  Biedl, T ^a   Genc, B ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33745673081     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Cartogram central. http://www.ncgia.ucsb.edu/ projects/Cartogram Central/, Web site at University of California at Santa Barbara, last accessed February 25, 2005.
2. J. Dougenik, N. Chrisman, and D. Riemeyer. An algo-rithm to construct continuous area cartograms. Profes-sional Geographer, 37:75-81, 1985.
3. H. Edelsbrunner and R. Waupotitsch. A combinatorial approach to cartograms. In SCG '95: Proceedings of the eleventh annual symposium on Computational geome-try, pages 98-108. ACM Press, 1995.
4. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
5. R. Heilmann, D. A. Keim, C. Panse, and M. Sips. Recmap: Rectangular map approximations. In IN-FOVIS '04: Proceedings of the IEEE Symposium on Information Visualization (INFOVIS'04), pages 33-40. IEEE Computer Society, 2004.
6. D. H. House and C. J. Kocmoud. Continuous cartogram construction. In VIS '98: Proceedings of the conference on Visualization '98, pages 197-204. IEEE Computer Society Press, 1998.
7. D. A. Keim, S. C. North, and C. Panse. Carto-draw: A fast algorithm for generating contiguous car-tograms. IEEE Transactions on Visualization and Computer Graphics, 10(1):95-110, 2004.
8. J. Olson. Noncontiguous area cartograms. Professional Geographer, 28:371-380, 1976.
9. M. S. Rahman, K. Miura, and T. Nishizeki. Octagonal drawings of plane graphs with prescribed face areas. In Graph-Theoretic Concepts in Computer Science: 30th International Workshop, volume 3353 of Lecture Notes in Computer Science, pages 320-331, 2004.
10. B. Speckmann. Personal communication.
11. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Computing, 16(3):421-444, 1987.
12. W. Tobler. Pseudo-cartograms. The American Cartog-rapher, 13:43-50, 1986.
13. M. v. Kreveld and B. Speckmann. On rectangular cartograms. In European Symposium on Algorithms (ESA'04), volume 3221 of Lecture Notes in Computer Science, pages 724-735, 2004.