Area-Universal and constrained rectangular layouts

SIAM Journal on Computing

Volumn 41, Issue 3, 2012, Pages 537-564

  Eppstein, David ^a   Mumford, Elena ^c   Speckmann, Bettina ^b   Verbeek, Kevin ^b  

^a Irvine   (United States)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c NONE

Author keywords

Area universal; Computational geometry; One sided; Rectangular cartogram; Rectangular layout

Indexed keywords

AREA-UNIVERSAL; AS GRAPH; DUAL GRAPHS; FINITE SET; FLOORPLANS; IN-BUILDINGS; ONE-SIDED; POLYNOMIAL-TIME; RECTANGULAR CARTOGRAM; RECTANGULAR LAYOUT; SUFFICIENT CONDITIONS; VLSI DESIGN;

MAPPING; MAPS; POLYNOMIAL APPROXIMATION;

COMPUTATIONAL GEOMETRY;

EID: 84865470687     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/110834032     Document Type: Article

References (27)

1. T. Biedl and B. Genc, Complexity of Octagonal and Rectangular Cartograms, Technical report CS-2005-13, School of Computer Science, University of Waterloo, Waterloo, ON, Canada, 2005.
2. G. Birkhoff, Rings of sets, Duke Math. J., 3 (1937), pp. 443-454.
3. G. Birkhoff and S. A. Kiss, A ternary operation in distributive lattices, Bull. Amer. Math. Soc., 52 (1947), pp. 749-752.
4. M. Bruls, K. Huizing, and J. J. van Wijk, Squarified treemaps, in Proceedings of the Eurographics and IEEE TCVG Symposium on Visualization, Springer, 2000, pp. 33-42.
5. K. Buchin, D. Eppstein, M. Löffler, M. Nöllenburg, and R. I. Silveira, Adjacencypreserving spatial treemaps, in Proceedings of the 12th Algorithms and Data Structures Symposium (WADS), 2011, pp. 159-170; available online at http://arxiv.org/abs/1105. 0398.
6. P. Dasgupta and S. Sur-Kolay, Slicible rectangular graphs and their optimal floorplans, ACM Trans. Design Automat. Electron. Systems, 6 (2001), pp. 447-470. (Pubitemid 33772183)
7. C. F. Earl and L. J. March, Architectural applications of graph theory, Applications of Graph Theory, R. Wilson and L. Beineke, eds., Academic Press, London, 1979, pp. 327-355.
8. D. Eppstein, Arboricity and bipartite subgraph listing algorithms, Inform. Process. Lett., 51 (1994), pp. 207-211. (Pubitemid 124013192)
9. D. Eppstein, Regular labelings and geometric structures, in Proceedings of the 22nd Canadian Conference on Computational Geometry, 2010, pp. 125-130.
10. D. Eppstein and E. Mumford, Steinitz theorems for orthogonal polyhedra, in Proceedings of the 26th ACM Symposium on Computational Geometry, 2010, pp. 429-438.
11. S. Felsner, Lattice structures from planar graphs, Electron. J. Combin., 11 (2004), R15.
12. E. Fusy, Transversal structures on triangulations, with application to straight-line drawing, in Proceedings of the 13th International Symposium on Graph Drawing (GD 2005), Lecture Notes in Comput. Sci. 3843, Springer, Berlin, 2006, pp. 177-188. (Pubitemid 43971515)
13. e. Fusy, Transversal structures on triangulations: A combinatorial study and straight-line drawings, Discrete Math., 309 (2009), pp. 1870-1894.
14. G. Kant and X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoret. Comput. Sci., 172 (1997), pp. 175-193. (Pubitemid 127451829)
15. K. Ko'zmi'nski and E. Kinnen, Rectangular duals of planar graphs, Networks, 5 (1985), pp. 145-157.
16. N. Megiddo, Linear programming in linear time when the dimension is fixed, J. ACM, 31 (1984), pp. 114-127. (Pubitemid 14507495)
17. E. Mumford, Drawing Graphs for Cartographic Applications, Ph.D. thesis, Technische Universiteit Eindhoven, Eindhoven, The Netherlands, 2008.
18. R. Niedermeier, Invitation to Fixed-parameter Algorithms, Oxford Lecture Ser. Math. Appl. 31, Oxford University Press, Oxford, UK, 2006.
19. J. Propp, Lattice Structure for Orientations of Graphs, Electronic preprint arxiv:math/0209005, 1993.
20. J. Propp, Generating random elements of finite distributive lattices, Electron. J. Combin., 4 (1997), R15.
21. E. Raisz, The rectangular statistical cartogram, Geograph. Rev., 24 (1934), pp. 292-296.
22. I. Rinsma, Nonexistence of a certain rectangular floorplan with specified areas and adjacency, Environ. Plann. B, 14 (1987), pp. 163-166.
23. I. Rinsma, Rectangular and orthogonal floorplans with required rooms areas and tree adjacency, Environ. Plann. B, 15 (1988), pp. 111-118.
24. H. Tang and W. K. Chen, Generation of rectangular duals of a planar triangulated graph by elementary transformations, in Proceedings of the IEEE International Symposium on Circuits and Systems, Vol. 4, 1990, pp. 2857-2860.
25. P. Ungar, On diagrams representing maps, J. London Math. Soc., 28 (1953), pp. 336-342.
26. S. Wimer, I. Koren, and I. Cederbaum, Floorplans, planar graphs, and layouts, IEEE Trans. Circuits Syst., 35 (1988), pp. 267-278.
27. G. K. H. Yeap and M. Sarrafzadeh, Sliceable floorplanning by graph dualization, SIAM J. Disc. Math., 8 (1995), pp. 258-280.