Computing cartograms with optimal complexity

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2012, Pages 21-30

  Alam, Md Jawaherul ^a   Biedl, Therese ^b   Felsner, Stefan ^c   Kaufmann, Michael ^d   Kobourov, Stephen G ^a   Ueckerdt, Torsten ^c  

^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

Cartograms; Contact graphs; Geometric representations; Planar graphs

Indexed keywords

CARTOGRAMS; COMBINATORIAL STRUCTURES; GEOMETRIC REPRESENTATION; HAMILTONIAN GRAPH; HAMILTONIAN PATH; HILL CLIMBING; LINEAR TIME; LOWER BOUNDS; NON-TRIVIAL; NUMERICAL ITERATION; ONE-LEGGED; OPTIMAL COMPLEXITY; PLANAR GRAPH; RUNNING TIME;

GRAPH THEORY; GRAPHIC METHODS; HAMILTONIANS; OPTIMIZATION;

COMPUTATIONAL GEOMETRY;

EID: 84863964949     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2261250.2261254     Document Type: Conference Paper

References (36)

1. M. J. Alam, T. C. Biedl, S. Felsner, A. Gerasch, M. Kaufmann, and S. G. Kobourov. Linear-time algorithms for hole-free rectilinear proportional contact graph representations. In ISAAC, pp. 281-291, 2011.
2. M. J. Alam, T. C. Biedl, S. Felsner, M. Kaufmann, and S. G. Kobourov. Proportional contact representations of planar graphs. In Graph Drawing, pp. 26-38, 2012.
3. T. C. Biedl and B. Genc. Complexity of octagonal and rectangular cartograms. In CCCG, pp. 117-120, 2005.
4. T. C. Biedl and L. E. R. Velázquez. Orthogonal cartograms with few corners per face. In WADS, pp. 98-109, 2011.
5. A. L. Buchsbaum, E. R. Gansner, C. M. Procopiuc, and S. Venkatasubramanian. Rectangular layouts and contact graphs. ACM Trans. on Algorithms, 4, 2008.
6. I. Cederbaum. Analogy between VLSI floorplanning problems and realisation of a resistive network. IEE Circuits, Devices and Systems, 139(1):99-103, 1992.
7. T. Chen and M. K. H. Fan. On convex formulation of the floorplan area minimization problem. In Symposium on Physical Design, pp. 124-128, 1998.
8. M. Chrobak and T. H. Payne. A linear-time algorithm for drawing a planar graph on a grid. Information Processing Letters, 54(4):241-246, 1995.
9. M. de Berg, E. Mumford, and B. Speckmann. On rectilinear duals for vertex-weighted plane graphs. Discrete Mathematics, 309(7):1794-1812, 2009.
10. M. de Berg, E. Mumford, and B. Speckmann. Optimal bsps and rectilinear cartograms. Int. J. Computational Geometry and Applications, 20(2):203-222, 2010.
11. H. de Fraysseix, P. O. de Mendez, and P. Rosenstiehl. On triangle contact graphs. Combinatorics, Probability and Computing, 3:233-246, 1994.
12. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10(1):41-51, 1990.
13. C. A. Duncan, E. R. Gansner, Y. F. Hu, M. Kaufmann, and S. G. Kobourov. Optimal polygonal representation of planar graphs. Algorithmica, 63(3):672-691, 2012.
14. D. Eppstein, E. Mumford, B. Speckmann, and K. Verbeek. Area-universal rectangular layouts. In SoCG, pp. 267-276, 2009.
15. X. He. On floor-plan of plane graphs. SIAM J. Computing, 28(6):2150-2167, 1999.
16. R. Heilmann, D. A. Keim, C. Panse, and M. Sips. Recmap: Rectangular map approximations. In INFOVIS, pp. 33-40, 2004.
17. D. House and C. Kocmoud. Continuous cartogram construction. In Visualization, pp. 197-204, 1998.
18. T. Izumi, A. Takahashi, and Y. Kajitani. Air-pressure model and fast algorithms for zero-wasted-area layout of general floorplan. IEICE Trans. Fundam. Electron., Commun. and Comp. Sci., E81-A:857-865, 1998.
19. A. Kawaguchi and H. Nagamochi. Orthogonal drawings for plane graphs with specified face areas. In TAMC 2007, pp. 584-594, 2007.
20. P. Koebe. Kontaktprobleme der konformen Abbildung. Berichte über die Verhandlungen der Sächsischen Akademie der Wissenschaften zu Leipzig. Math.-Phys. Klasse, 88:141-164, 1936.
21. K. Kózmiński and E. Kinnen. Rectangular duals of planar graphs. Networks, 15:145-157, 1985.
22. S. M. Leinwand and Y.-T. Lai. An algorithm for building rectangular floor-plans. In Design Automation Conference, pp. 663-664, 1984.
23. C.-C. Liao, H.-I. Lu, and H.-C. Yen. Compact floor-planning via orderly spanning trees. J. Algorithms, 48:441-451, 2003.
24. J. Michalek, R. Choudhary, and P. Papalambros. Architectural layout design optimization. Engineering Optimization, 34(5):461-484, 2002.
25. T.-S. Moh, T.-S. Chang, and S. L. Hakimi. Globally optimal floorplanning for a layout problem. IEEE Trans. on Circuits and Systems, 43(9):713-720, 1996.
26. E. Raisz. The rectangular statistical cartogram. Geographical Review, 24(3):292-296, 1934.
27. I. Rinsma. Nonexistence of a certain rectangular floorplan with specified area and adjacency. Environment and Planning, 14:163-166, 1987.
28. E. Rosenberg. Optimal module sizing in VLSI floorplanning by nonlinear programming. Methods and Models of Operations Research, 33:131-143, 1989.
29. W. Schnyder. Embedding planar graphs on the grid. In SODA, pp. 138-148, 1990.
30. W. Tobler. Thirty five years of computer cartograms. Annal. Assoc. Amer. Geographers, 94:58-73, 2004.
31. T. Ueckerdt. Geometric Representations of Graphs with low Polygonal Complexity. PhD thesis, Technische Universität Berlin, 2011.
32. P. Ungar. On diagrams representing graphs. J. London Mathematical Society, 28:336-342, 1953.
33. M. J. van Kreveld and B. Speckmann. On rectangular cartograms. Comput. Geom., 37(3):175-187, 2007.
34. K. Wang and W.-K. Chen. Floorplan area optimization using network analogous approach. In IEEE International Symposium on Circuits and Systems, pp. 167-170, 1995.
35. S. Wimer, I. Koren, and I. Cederbaum. Floorplans, planar graphs, and layouts. IEEE Trans. on Circuits and Systems, 35(3):267-278, 1988.
36. K.-H. Yeap and M. Sarrafzadeh. Floor-planning by graph dualization: 2-concave rectilinear modules. SIAM J. Computing, 22:500-526, 1993.