On the number of rectangulations of a planar point set

Journal of Combinatorial Theory. Series A

Volumn 113, Issue 6, 2006, Pages 1072-1091

  Ackerman, Eyal ^a   Barequet, Gill ^a   Pinter, Ron Y ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Baxter permutations; Guillotine partitions; Rectangular partitions; Rectangulations; Schr der numbers; Separable permutations

Indexed keywords

EID: 33745503207     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/j.jcta.2005.10.003     Document Type: Article

References (26)

1. Avis D., and Newborn M. On pop-stacks in series. Util. Math. 19 (1981) 129-140
2. Avis D., and Fukuda K. Reverse search for enumeration. Discrete Appl. Math. 65 (1996) 21-46
3. Baxter G. On fixed points of the composite of commuting functions. Proc. Amer. Math. Soc. 15 (1964) 851-855
4. Bose P., Buss J.F., and Lubiw A. Pattern matching for permutations. Inform. Process. Lett. 65 (1998) 277-283
5. Calheiros F.C., Lucena A., and de Souza C.C. Optimal rectangular partitions. Networks 41 1 (2003) 51-67
6. Cardei M., Cheng X., Cheng X., and Du D.Z. A tale on guillotine cut. In: Pardalos P.M., and Wolkowicz H. (Eds). Novel Approaches to Hard Discrete Optimization. Fields Inst. Commun. vol. 37 (2003), Amer. Math. Soc. 41-54
7. Chung F.R.K., Graham R.L., Hoggatt V.E., and Kleiman M. The number of Baxter permutations. J. Combin. Theory Ser. A 24 (1978) 382-394
8. de Fraysseix H., de Mendez P.O., and Pach J. A left-first search algorithm for planar graphs. Discrete Comput. Geom. 13 (1995) 459-468
9. D.Z. Du, L.Q. Pan, M.T. Shing, Minimum edge length guillotine rectangular partition, Technical Report MSRI 02418-86, University of California, Berkeley, CA, 1986
10. Dulucq S., and Guibert O. Baxter permutations. Discrete Math. 180 (1998) 143-156
11. T.F. Gonzalez, S.-Q. Zheng, Bounds for partitioning rectilinear polygons, in: Proc. 1st ACM Symp. on Computational Geometry, Baltimore, MD, 1985, pp. 281-287
12. Gonzalez T.F., and Zheng S.-Q. Improved bounds for rectangular and guillotine partitions. J. Symbolic Comput. 7 (1989) 591-610
13. Gonzalez T.F., and Zheng S.-Q. Approximation algorithms for partitioning a rectangle with interior points. Algorithmica 5 (1990) 11-42
14. X. Hong, G. Huang, Y. Cai, J. Gu, S. Dong, C.K. Cheng, J. Gu, Corner block list: An effective and efficient topological representation of non-slicing floorplan, in: Proc. IEEE/ACM Int. Conf. on Computer-Aided Design, San Jose, CA, 2000, pp. 8-12
15. C. Levcopoulos, Fast heuristics for minimum length rectangular partitions of polygons, in: Proc. 2nd ACM Symp. on Computational Geometry, Yorktown Heights, NY, 1986, pp. 100-108
16. A. Lingas, R.Y. Pinter, R.L. Rivest, A. Shamir, Minimum edge length rectilinear decompositions of rectilinear figures, in: Proc. 20th Allerton Conf. on Communication, Control, and Computing, Monticello, IL, 1982, pp. 53-63
17. Mitchell J.S.B. Guillotine subdivisions. Part II. A simple polynomial-time approximation scheme for geometric k-MST, TSP, and related problems. SIAM J. Comput. 28 (1999) 1298-1309
18. J.I. Munro, Th. Papadakis, and R. Sedgewick, Deterministic skip lists, in: Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, Orlando, FL, 1992, pp. 367-375
19. Sakanushi K., Kajitani Y., and Mehta D.P. The quarter-state-sequence floorplan representation. IEEE Trans. Circuits Systems I: Fund. Theory Appl. 50 3 (2003) 376-386
20. Santos F., and Seidel R. A better upper bound on the number of triangulations of a planar point set. J. Combin. Theory Ser. A 102 (2003) 186-193
21. Shapiro L., and Stephens A.B. Bootstrap percolation, the Schröder numbers, and the N-Kings problem. SIAM J. Discrete Math. 4 (1991) 275-280
22. Shen Z.C., and Chu C.C.N. Bounds on the number of slicing, mosaic, and general floorplans. IEEE Trans. Computer-Aided Design Integrated Circuits Systems 22 10 (2003) 1354-1361
23. N.J.A. Sloane (Ed.), The on-line encyclopedia of integer sequences, published electronically at. http://www.research.att.com/~njas/sequences/
24. Stanley R.P. Enumerative Combinatorics, vol. 2 (1999), Cambridge Univ. Press, Cambridge
25. West J. Generating trees and the Catalan and Schröder numbers. Discrete Math. 146 (1995) 247-262
26. Yao B., Chen H., Cheng C.K., and Graham R. Floorplan representations: Complexity and connections. ACM Trans. Design Automat. Electron. Syst. 8 (2003) 55-80