Linear-time algorithms for hole-free rectilinear proportional contact graph representations

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

Volumn 7074 LNCS, Issue , 2011, Pages 281-291

  Alam, Muhammad Jawaherul ^a   Biedl, Therese ^b   Felsner, Stefan ^c   Gerasch, Andreas ^d   Kaufmann, Michael ^d   Kobourov, Stephen G ^a  

^a University of Arizona   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^d UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AREA-PROPORTIONAL; BEST-KNOWN ALGORITHMS; GRAPH REPRESENTATION; LINEAR-TIME ALGORITHMS; PLANAR GRAPH; SIMPLE POLYGON; WHITE SPACE;

CLUSTERING ALGORITHMS; FORESTRY; GRAPHIC METHODS;

TREES (MATHEMATICS);

ALGORITHMS; FORESTRY; MATHEMATICS; TREES;

EID: 84055200211     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25591-5_30     Document Type: Conference Paper

References (22)

1. Alam, M.J., Biedl, T., Felsner, S., Gerasch, A., Kaufmann, M., Kobourov, S.G.: Linear-time algorithms for proportional contact graph representations. Technical Report CS-2011-19, University of Waterloo (2011)
2. Alam, M.J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S., Ueckert, T.: Computing cartograms with optimal complexity (2011) (submitted)
3. Biedl, T., Ruiz Velázquez, L.E.: Drawing Planar 3-Trees with Given Face-Areas. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 316-322. Springer, Heidelberg (2010)
4. Biedl, T., Ruiz Velázquez, L.E.: Orthogonal Cartograms with Few Corners Per Face. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.)WADS 2011. LNCS, vol. 6844, pp. 98-109. Springer, Heidelberg (2011)
5. Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Transactions on Algorithms 4(1) (2008)
6. de Berg, M., Mumford, E., Speckmann, B.: On rectilinear duals for vertex-weighted plane graphs. Discrete Mathematics 309(7), 1794-1812 (2009)
7. Gansner, E.R., Hu, Y.F., Kaufmann, M., Kobourov, S.G.: Optimal Polygonal Representation of Planar Graphs. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 417-432. Springer, Heidelberg (2010)
8. He, X.: On floor-plan of plane graphs. SIAMJournal of Computing 28(6), 2150-2167 (1999)
9. Heilmann, R., Keim, D.A., Panse, C., Sips, M.: Recmap: Rectangular map approximations. In: 10th IEEE Symp. on Information Visualization (InfoVis 2004), pp. 33-40 (2004)
10. 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)
11. Koźmiński, K., Kinnen, E.: Rectangular duals of planar graphs. Networks 15, 145-157 (1985)
12. Liao, C.-C., Lu, H.-I., Yen, H.-C.: Compact floor-planning via orderly spanning trees. Journal of Algorithms 48, 441-451 (2003)
13. Mondal, D., Nishat, R.I., Rahman, M.S., Alam, M.J.: Minimum-area drawings of plane 3-trees. In: CCCG, pp. 191-194 (2010)
14. Rahman, M.S., Miura, K., Nishizeki, T.: Octagonal drawings of plane graphs with prescribed face areas. Computational Geometry 42(3), 214-230 (2009)
15. Ringel, G.: Equiareal graphs. In: Bodendiek, R. (ed.) Contemporary Methods in Graph Theory, pp. 503-505. Wissenschaftsverlag (1990)
16. Rinsma, I.: Nonexistence of a certain rectangular floorplan with specified area and adjacency. Environment and Planning B: Planning and Design 14, 163-166 (1987)
17. Schnyder, W.: Embedding planar graphs on the grid. In: SODA, pp. 138-148 (1990)
18. Sun, Y., Sarrafzadeh, M.: Floorplanning by graph dualization: L-shaped modules. Algorithmica 10(6), 429-456 (1993)
19. Thomassen, C.: Plane cubic graphs with prescribed face areas. Combinatorics, Probability & Computing 1, 371-381 (1992)
20. Ungar, P.: On diagrams representing graphs. J. London Math. Soc. 28, 336-342 (1953)
21. van Kreveld, M.J., Speckmann, B.: On rectangular cartograms. Computational Geometry 37(3), 175-187 (2007)
22. Yeap, K.-H., Sarrafzadeh, M.: Floor-planning by graph dualization: 2-concave rectilinear modules. SIAM Journal on Computing 22, 500-526 (1993)