Orthogonal cartograms with few corners per face

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

Volumn 6844 LNCS, Issue , 2011, Pages 98-109

  Biedl, Therese ^a   Ruiz Velázquez, Lesvia Elena ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ORTHOGONAL DRAWINGS; PLANAR GRAPH;

DATA STRUCTURES; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALGORITHMS; DATA STRUCTURES;

EID: 80052136045     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22300-6_9     Document Type: Conference Paper

References (29)

1. Alam, J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S.G.: Proportional contact representations of planar graphs with rectilinear polygons (in preparation)
2. Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. Int. J. Comput. Geometry Appl. 7(3), 211-223 (1997)
3. Chrobak, M., Nakano, S.: Minimum-width grid drawings of plane graphs. In: GD 1994. LNCS, vol. 894, pp. 104-110. Springer, Heidelberg (1994)
4. de Berg, M., Mumford, E., Speckmann, B.: On rectilinear duals for vertex-weighted plane graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 61-72. Springer, Heidelberg (2006) (Pubitemid 43971504)
5. de Berg, M., Mumford, E., Speckmann, B.: Optimal BSPs and rectilinear cartograms. In: ACM Intl. Symp. on Advances in Geographic Information Systems (GIS 2006), pp. 19-26. ACM, New York (2006)
6. de Berg, M., Mumford, E., Speckmann, B.: On rectilinear duals for vertex-weighted plane graphs. Discrete Mathematics 309(7), 1794-1812 (2009)
7. de Berg, M., Mumford, E., Speckmann, B.: Optimal BSPs and rectilinear cartograms. Int. J. Comput. Geometry Appl. 20(2), 203-222 (2010)
8. de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10, 41-51 (1990)
9. Dujmović, V., Eppstein, D., Suderman, M., Wood, D.: Drawings of planar graphs with few slopes and segments. In: Comput. Geom. Theory Appl., vol. 38, pp. 194-212. Springer, Heidelberg (2005)
10. Eppstein, D., Mumford, E., Speckmann, B., Verbeek, K.: Area-universal rectangular layouts. In: ACM Symposium on Computational Geometry (SoCG 2009), pp. 267-276 (2009)
11. Fáry, I.: On straight line representation of planar graphs. Acta. Sci. Math. Szeged 11, 229-233 (1948)
12. Geelen, J., Guo, A., McKinnon, D.: Straight line embeddings of cubic planar graphs with integer edge lengths. Journal of Graph Theory 58(3), 270-274 (2008)
13. Heilmann, R., Keim, D.A., Panse, C., Sips, M.: Recmap: Rectangular map approximations. In: InfoVis 2004, pp. 33-40. IEEE, Los Alamitos (2004)
14. Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16(1), 4-32 (1996)
15. Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theor. Comput. Sci. 172(1-2), 175-193 (1997)
16. Kawaguchi, A., Nagamochi, H.: Orthogonal drawings for plane graphs with specified face areas. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol. 4484, pp. 584-594. Springer, Heidelberg (2007) (Pubitemid 47619239)
17. Kreveld, M. van, Speckmann, B.: On rectangular cartograms. Comput. Geom. Theory Appl. 37(3), 175-187 (2007)
18. Meulemans, W., van Renssen, A., Speckmann, B.: Area-preserving subdivision schematization. In: Fabrikant, S.I., Reichenbacher, T., Kreveld, M. van, Schlieder, C. (eds.) GIScience 2010. LNCS, vol. 6292, pp. 160-174. Springer, Heidelberg (2010)
19. Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. Lecture Notes Series on Computing. World Scientific Publishing Company, Singapore (2004)
20. Rahman, M.S., Miura, K., Nishizeki, T.: Octagonal drawings of plane graphs with prescribed face areas. Comput. Geom. Theory Appl. 42(3), 214-230 (2009)
21. Raisz, E.: The rectangular statistical cartogram. Geographical Review 24(3), 292-296 (1934)
22. Ringel, G.: Equiareal graphs. Contemporary Methods in Graph Theory. BI Wissenschaftsverlag, 503-505 (1990)
23. Ruiz Velázquez, L.E.: Drawing planar graphs with prescribed face areas. Master's thesis. University of Waterloo (2010), http://uwspace.uwaterloo. ca/bitstream/10012/5481/1/RuizVelazquezLesviaElena.pdf
24. Schnyder, W.: Embedding planar graphs on the grid. In: SODA 1990: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 138-148. Society for Industrial and Applied Mathematics, Philadelphia (1990)
25. Stein, S.: Convex maps. American Mathematical Society 2, 464-466 (1951)
26. Thomassen, C.: Plane cubic graphs with prescribed face areas. Combinatorics, Probability & Computing 1, 371-381 (1992)
27. Ungar, P.: On Diagrams Representing Maps. Journal of the London Mathematical Society s1-28(3), 336-342 (1953)
28. Wagner, K.: Bemerkungen zum Vierfarbenproblem. Jahresbericht der Deutschen Mathematiker-Vereinigung 46, 26-32 (1936)
29. Yeap, K.H., Sarrafzadeh, M.: Floor-planning by graph dualization: 2-concave rectilinear modules. SIAM Journal on Computing 22, 500-526 (1993)