On rectilinear duals for vertex-weighted plane graphs

Discrete Mathematics

Volumn 309, Issue 7, 2009, Pages 1794-1812

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

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Cartogram; Rectilinear layout

Indexed keywords

A PLANES; CARTOGRAM; GRAPH G; PLANE GRAPHS; RECTILINEAR LAYOUT;

GRAPH THEORY;

EID: 61749086425     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.12.087     Document Type: Article

References (16)

1. Bhasker J., and Sahni S. A linear algorithm to check for the existence of a rectangular dual of a planar triangulated graph. Networks 7 (1987) 307-317
2. T. Biedl, B. Genc, Complexity of octagonal and rectangular cartograms, Technical Report, University of Waterloo, 2005
3. d'Amore F., and Franciosa P. On the optimal binary plane partition for sets of isothetic rectangles. Information Processing Letters 44 5 (1992) 255-259
4. M. de Berg, E. Mumford, B. Speckmann, Optimal BSPs and rectilinear cartograms, in: Proc. 14th International Symposium on Advances in Geographic Information Systems, 2006, pp. 19-26
5. Cartogram Central. http://www.ncgia.ucsb.edu/projects/Cartogram_Central/index.html
6. Dent B. Cartography - Thematic Map Design. 5th edn (1999), McGraw-Hill
7. Dougenik N., and Niemeyer D. An algorithm to construct continuous area cartograms. Professional Geographer 3 (1985) 75-81
8. R. Heilmann, D. Keim, C. Panse, M. Sips, Recmap: Rectangular map approximations. in: Proc. IEEE Symposium on Information Visualization, 2004, pp. 33-40
9. Kant G., and He X. Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science 172 (1997) 175-193
10. Koźmiński K., and Kinnen E. Rectangular dual of planar graphs. Networks 5 (1985) 145-157
11. Kreveld M.v., and Speckmann B. On rectangular cartograms. Computational Geometry: Theory and Applications 37 3 (2007) 175-187
12. Liao C.-C., Lu H.-I., and Yen H.-C. Compact floor-planning via orderly spanning trees. Journal of Algorithms 48 (2003) 441-451
13. Rahman M., Miura K., and Nishizeki T. Octagonal drawings of plane graphs with prescribed face areas. Proce. 30th International Workshop on Graph-Theoretic Concepts in Computer Science. LNCS vol. 3353 (2004), Springer 320-331
14. Raisz E. The rectangular statistical cartogram. Geographical Review 24 (1934) 292-296
15. Thomassen C. Plane cubic graphs with prescribed face areas. Combinatorics, Probability and Computing 1 (1992) 371-381
16. Yeap G., and Sarrafzadeh M. Sliceable floorplanning by graph dualization. SIAM Journal of Discrete Mathematics 8 2 (1995) 258-280