Optimal BSPs and rectilinear cartograms

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Volumn , Issue , 2006, Pages 19-26

  De Berg, Mark ^a   Mumford, Elena ^a   Speckmann, Bettina ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Automated cartography; Binary space partitions; Cartograms; Geometric algorithms; Indexing structures

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COST FUNCTIONS; QUALITY CONTROL; STATISTICAL METHODS; VISUALIZATION;

AUTOMATED CARTOGRAPHY; BINARY SPACE PARTITIONS; CARTOGRAMS; INDEXING STRUCTURES;

GEOGRAPHIC INFORMATION SYSTEMS;

EID: 34547451156     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1183471.1183476     Document Type: Conference Paper

References (21)

1. J. Bhasker and S. Sahni. A linear algorithm to check for the existence of a rectangular dual of a planar triangulated graph. Networks, 7:307-317, 1987.
2. T. Cormen, C. Leisereon, R. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2nd edition, 2001.
3. F. d'Amore and P. G. Franciosa. On the optimal binary plane partition for sets of isothetic rectangles. Information Processing Letters, 44(5):255-259, 1992.
4. M. de Berg, E. Mumford, and B. Speckmann. On rectilinear duals for vertex-weighted plane graphs. In Proc. 13th Intern. Symposium on Graph Drawing, number 3843 in LNCS, pages 61-72, 2005.
5. B. Dent. Cartography: Thematic Map Design. McGraw-Hill, 5th edition, 1999.
6. D. Dorling. Area Cartograms: their Use and Creation. Number 59 in Concepts and Techniques in Modern Geography. University of East Anglia, Environmental Publications, Norwich, 1996.
7. J. A. Dougenik, N. R. Chrisman, and D. R. Niemeyer. An algorithm to construct continuous area cartograms. The Professional Geographer, 37(1):75-81, 1985.
8. H. Edelsbrunner and E. Waupotitsch. A combinatorial approach to cartograms. Computational Geometry: Theory and Applications, 7:343-360, 1997.
9. M. Gastner and M. Newman. Diffusion-based method for producing density-equalizing maps. Proc. National Academy of Sciences of the United States of America, 101(20):7499-7504, 2004.
10. R. Heilmann, D. A. Keim, C. Panse, and M. Sips. Recmap: Rectangular map approximations. In Proc. IEEE Symposium on Information Visualization, pages 33-40, 2004.
11. G. Kant and X. He. Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science, 172:175-193, 1997.
12. D. Keim, S. North, and C. Panse. Cartodraw: A fast algorithm for generating contiguous cartograms. IEEE Transactions on Visualization and Computer Graphics, 10:95-110, 2004.
13. C. Kocmoud and D. House. A constraint-based approach to constructing continuous cartograms. In Proc. 8th Intern. Symposium on Spatial Data Handling, pages 236-246, 1998.
14. K. Koźmiński and E. Kinnen. Rectangular dual of planar graphs. Networks, 5:145-157, 1985.
15. J. Olson. Noncontiguous area cartograms. Professional Geographer, 28:371-380, 1976.
16. E. Raisz. The rectangular statistical cartogram. Geographical Review, 24:292-296, 1934.
17. H. Samet, editor. The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1989.
18. B. Speckmann, M. van Kreveld, and S. Florisson. A linear programming approach to rectangular cartograms. In Proc. 12th Intern. Symposium on Spatial Data Handling, pages 250-257, 2006.
19. W. Tobler. Pseudo-cartograms. The American Cartographer, 13:43-50, 1986.
20. M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors. Algorithmic Foundations of Geographic Information Systems. Springer, 1997.
21. M. van Kreveld and B. Speckmann. On rectangular cartograms. In Proc. 12th Europ. Symposium on Algorithms, number 3221 in LNCS, pages 724-735, 2004.