On rectilinear duals for vertex-weighted plane graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3843 LNCS, Issue , 2006, Pages 61-72

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

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MAPPING; NUMERICAL ANALYSIS;

CARTOGRAM; RECTILINEAR DUALS; VERTEX-WEIGHTED PLANE GRAPHS;

GRAPH THEORY;

EID: 33745655629     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11618058_6     Document Type: Conference Paper

References (15)

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. Biedl and B. Gene. Complexity of octagonal and rectangular cartograms. In Proceedings of the 17th Canadian Conference on Computational Geometry, pages 117-120, 2005.
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. B. Dent. Cartography - thematic map design. McGraw-Hill, 5th edition, 1999.
5. J. A. Dougenik, N. R. Chrisman, and D. R. Niemeyer. An algorithm to construct continous area cartograms. Professional Geographer, 37:75-81, 1985.
6. R. Heilmann, D. A. Keim, C. Panse, and M. Sips. Recmap: Rectangular map approximations. In Proceedings of the IEEE Symposium on Information Visualization (INFOVIS), pages 33-40, 2004.
7. 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.
8. K. Koźmiński and E. Kinnen. Rectangular dual of planar graphs. Networks, 5:145-157, 1985.
9. C.-C. Liao, H.-I. Lu, and H.-C. Yen. Floor-planning using orderly spanning trees. Journal of Algorithms, 48:441-451, 2003.
10. NCGIA / USGS. Cartogram Central, 2002. http://www.ncgia.ucsb.edu/ projects/Cartogram_Central/index.html.
11. M. S. Rahman, K. Miura, and T. Nishizeki. Octagonal drawings of plane graphs with prescribed face areas. In Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), number 3353 in LNCS, pages 320-331. Springer, 2004.
12. E. Raisz. The rectangular statistical cartogram. Geographical Review, 24:292-296, 1934.
13. C. Thomassen. Plane cubic graphs with prescribed face areas. Combinatorics, Probability and Computing, 1:371-381, 1992.
14. M. van Kreveld and B. Speckmann. On rectangular cartograms. Computational Geometry: Theory and Applications, 2005. To appear.
15. G. K. Yeap and M. Sarrafzadeh. Sliceable floorplanning by graph dualization. SIAM Journal of Discrete Mathematics, 8(2):258-280, 1995.