Optimal BSPs and rectilinear cartograms

International Journal of Computational Geometry and Applications

Volumn 20, Issue 2, 2010, Pages 203-222

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

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Binary space partition; Cartogram; Rectilinear map

Indexed keywords

EID: 77951670196     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195910003268     Document Type: Article

References (22)

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 (1987) 307-317.
2. T. Cormen, C. Leiserson, R. Rivest 1and C. Stein, Introduction to Algorithms, 2nd edition (MIT Press, 2001).
3. F. d'Amore and P. G. Franciosa, On the optimal binary plane partition for sets of isothetic rectangles, Inform. Process. Lett. 44 (5) (1992) 255-259.
4. M. de Berg, E. Mumford and B. Speckmann, On rectilinear duals for vertex-weighted plane graphs, Discr. Math. 309 (7) (2009) 1794-1812.
5. X. Clairbois, Optimal binary space partitions, MSc thesis, TU Eindhoven, 2006.
6. B. Dent, Cartography: Thematic Map Design 5th edition (McGraw-Hill, 1999).
7. 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.
8. J. A. Dougenik, N. R. Chrisman and D. R. Niemeyer, An algorithm to construct continuous area cartograms, The Professional Geographer 37 (1) (1985) 75-81.
9. H. Edelsbrunner and E. Waupotitsch, A combinatorial approach to cartograms, Comput. Geom.: Th. Appl. 7 (1997) 343-360. (Pubitemid 27476566)
10. M. Gastner and M. Newman, Diffusion-based method for producing density-equalizing maps, Proc. Nat. Acad. Sci. USA 101 (20) (2004) 7499-7504. (Pubitemid 38658057)
11. R. Heilmann, D. A. Keim, C. Panse and M. Sips, Recmap: Rectangular map approximations, Proc. IEEE Symp. Information Visualization (2004), pp. 33-40. (Pubitemid 40449125)
12. G. Kant and X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoret. Comput. Sci. 172 (1997) 175-193. (Pubitemid 127451829)
13. D. Keim, S. North and C. Panse, Cartodraw: A fast algorithm for generating contiguous cartograms, IEEE Trans. Visual. Comput. Graph. 10 (2004) 95-110.
14. C. Kocmoud and D. House, A constraint-based approach to constructing continuous cartograms, Proc. 8th Int. Symp. Spatial Data Handling (1998), pp. 236-246.
15. K. Koźmiński and E. Kinnen, Rectangular dual of planar graphs, Networks 5 (1985) 145-157.
16. J. Olson, Noncontiguous area cartograms, Professional Geographer 128 (1976) 371-380.
17. E. Raisz, The rectangular statistical cartogram, Geograph. Rev. 24 (1934) 292-296.
18. H. Samet (ed.), The Design and Analysis of Spatial Data Structures (Addison-Wesley, 1989).
19. B. Speckmann, M. van Kreveld 1and S. Florisson, A linear programming approach to rectangular cartograms, Proc. 12th Int. Symp. Spatial Data Handling (2006) pp. 250-257.
20. W. Tobler, Pseudo-cartograms, The American Cartographer 13 (1986) 43-50.
21. M. van Kreveld, J. Nievergelt, T. Roos and P. Widmayer (eds.), Algorithmic Foundations of Geographic Information Systems (Springer, 1997).
22. M. van Kreveld and B. Speckmann, On rectangular cartograms, Comput. Geom.: Th. Appl. 37 (3) (2007) 175-187. (Pubitemid 46661303)