Transformations among rectangular partitions

[1] E. Ackerman, G. Barequet and R. Y. Pinter, A bijection between permutations and floorplans, and its applications,
Discrete Appl. Math., 154 (2006) 1674–1684.

[2] A. Recuero, O. Río and M. Alvarez, Heuristic method to check the realisability of a graph into a rectangular plan,
Adv. Eng. Soft., 31 (2000) 223–231.

[3] J. Bhasker and S. Sahni, A linear time algorithm to check for the existence of a rectangular dual of a planar
triangulated graph, Networks, 17 (1987) 307–317.

[4] J. Bhasker and S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica,
3 (1988) 247–278.

[5] B. D. He, A simple optimal binary representation of mosaic floorplans and Baxter permutations, Theor. Comput.
Sci., 532 (2014) 40–50.

[6] D. Eppstein, E. Mumford, B. Speckmann and K. Verbeek, Area-universal and constrained rectangular layouts, SIAM
J. Comput., 41 (2012) 537–564.

[7] K. Koźmiński and E. Kinnen, Rectangular dual of planar graphs, Networks, 15 (1985) 145–157.

[8] S. Felsner, Exploiting air-pressure to map oorplans on point sets, J. Graph Algorithms Appl., 18 (2014) 233–252.

[9] Y.-T. Lai and S. M. Leinwand, Algorithms for floorplan design via rectangular dualization, IEEE Trans. Comput.
Aided Des., 7 (1988) 1278–1289.

[10] Y.-T. Lai and S. M. Leinwand, A theory of rectangular dual graphs, Algorithmica, 5 (1990) 467–483.

[11] I. Rinsma, Rectangular floorplan and orthogonal floorplans with required room areas and tree adjacency, Environ-
ment and Planning B: Planning and Design, 15 (1988) 111–118.

[12] K. Koźmiński and E. Kinnen, Rectangular dualization and rectangular dissections, IEEE Trans. Circuits and Sys-
tems., 35 (1988) 1401–1416.

[13] K. Yamanaka, M. S. Rahman and S.-I. Nakano, Floorplans with columns, Combinatorial optimization and applica-
tions. Part I, Lecture Notes in Comput. Sci., Springer, Cham, (2017) 33–40.

[14] H. Tang and W.-K. Chen, Generation of rectangular duals of a planar triangulated graph by elementary transfor-
mations, IEEE Int. Symp. Circuits and Systems, 4 (1990) 2857–2860.

[15] B. Yao, and H. Chen, C.-k. Cheng and R. Graham, Floorplan Representations: Complexity and Connections, ACM
Trans. Des. Autom. Electron. Syst., 8 (2003) 55–80.

[16] N. Reading, Generic rectangulations, European J. Combin., 33 (2012) 610–623.

[17] K. Shekhawat, Enumerating generic rectangular floor plans, Autom. Constr., 92 (2018) 151–165.

[18] C.-W. Sham and E. F. Y. Young, Area reduction of dead space utilization on interconnect optimized floorplan,
ACM Trans. Des. Automat. Elect. Syst., 12 (2007) 1–11.

[19] V. Kumar and K. Shekhawat, A transformation algorithm to construct a rectangular floorplan, Theoret. Comput.
Sci., 871 (2021) 94–106.

[20] X. He, On finding the rectangular duals of planar triangular graphs, SIAM J. Comput., 22 (1993) 1218–1226.

[21] X.-Y. Wang, Y. Yang and K. Zhang, Customization and generation of floor plans based on graph transformations,
Autom. Constr., 94 (2018) 405–416.