Area-universal rectangular layouts

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2009, Pages 267-276

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

^a Irvine   (United States)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AS GRAPH; DUAL GRAPHS; FINITE SET; FLOORPLANS; IN-BUILDINGS; SUFFICIENT CONDITIONS; VLSI DESIGN;

MAPPING; MAPS; SET THEORY;

COMPUTATIONAL GEOMETRY;

EID: 70849128771     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542362.1542411     Document Type: Conference Paper

References (19)

1. T. Biedl and B. Genc. Complexity of Octagonal and Rectangular Cartograms. Technical Report CS-2005-13, University of Waterloo, School of Computer Science, 2005.
2. G. Birkhoff. Rings of sets. Duke Mathematical Journal, 3(3):443-454, 1937.
3. M. Bruls, K. Huizing, and J. J. van Wijk. Squarified treemaps. In Proc. Eurographics and IEEE TCVG Symp. on Visualization, pages 33-42. Springer, 2000.
4. P. Dasgupta and S. Sur-Kolay. Slicible rectangular graphs and their optimal floorplans. ACM Transactions on Design Automation of Electronic Systems, 6(4):447-470, 2001.
5. C. F. Earl and L. J. March. Architectural applications of graph theory. In R. Wilson and L. Beineke, editors, Applications of Graph Theory, pages 327-355. Academic Press, London, 1979.
6. D. Eppstein. Arboricity and bipartite subgraph listing algorithms. Information Processing Letters, 51(4):207-211, August 1994.
7. É. Fusy. Transversal structures on triangulations, with application to straight-line drawing. In Proc. 13th Int. Symp. on Graph Drawing (GD 2005), volume 3843 of LNCS, pages 177-188. Springer, 2006.
8. É. Fusy. Transversal structures on triangulations: A combinatorial study and straight-line drawings. Discrete Mathematics, 2009. To appear.
9. G. Kant and X. He. Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science, 172(1-2):175-193, 1997.
10. K. Koźmiński and E. Kinnen. Rectangular duals of planar graphs. Networks, 5(2):145-157, 1985.
11. N. Megiddo. Linear programming in linear time when the dimension is fixed. Journal of the ACM, 31(1):114-127, 1984.
12. E. Mumford. Drawing Graphs for Cartographic Applications. PhD thesis, Technische Universiteit Eindhoven, 2008.
13. R. Niedermeier. Invitation to Fixed-parameter Algorithms, volume 31 of Oxford Lecture Series in Mathematics and its Applications. Oxford University Press, 2006.
14. E. Raisz. The rectangular statistical cartogram. Geographical Review, 24(2):292-296, 1934.
15. I. Rinsma. Nonexistence of a certain rectangular floorplan with specified areas and adjacency. Env. And Planning B: Planning and Design, 14(2):163-166, 1987.
16. I. Rinsma. Rectangular and orthogonal floorplans with required rooms areas and tree adjacency. Env. And Planning B: Planning and Design, 15:111-118, 1988.
17. H. Tang and W.-K. Chen. Generation of rectangular duals of a planar triangulated graph by elementary transformations. In IEEE Int. Symp. Circuits and Systems, volume 4, pages 2857-2860, 1990.
18. S. Wimer, I. Koren, and I. Cederbaum. Floorplans, planar graphs, and layouts. IEEE Trans. Circuits and Systems, 35(3):267-278, 1988.
19. G. K. H. Yeap and M. Sarrafzadeh. Sliceable floorplanning by graph dualization. SIAM Journal of Discrete Mathematics, 8(2):258-280, 1995.