Coding Floorplans with Fewer Bits

A naive coding of floorplans needs 2m bits for each floorplan. In this paper we give a new simple coding of floorplans, which needs only 5m/3 bits for each floorplan.

[1]  Jeremy P. Spinrad,et al.  Efficient graph representations , 2003, Fields Institute monographs.

[2]  Shin-ichi Nakano.  Enumerating Floorplans with Some Properties , 2002 .

[3]  Md. Saidur Rahman,et al.  Rectangular drawings of planar graphs , 2002, J. Algorithms.

[4]  Shin-Ichi Nakano.  Enumerating Floorplans with n Rooms , 2001, ISAAC.

[5]  Kenneth H. Rosen.  Handbook of Discrete and Combinatorial Mathematics , 1999 .

[6]  Jeffery R. Westbrook,et al.  Short Encodings of Planar Graphs and Maps , 1995, Discret. Appl. Math..

[7]  Yi-Ting Chiang,et al.  Orderly spanning trees with applications to graph encoding and graph drawing , 2001, SODA '01.

[8]  Goos Kant,et al.  Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems , 1997, Theor. Comput. Sci..

[9]  Avi Wigderson,et al.  Succinct Representations of Graphs , 1984, Inf. Control..

[10]  Xin He,et al.  Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses , 1998, ICALP.

[11]  Krzysztof Kozminski,et al.  An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Planning for VLSI Integrated Circuits , 1984, 21st Design Automation Conference Proceedings.

[12]  Mihalis Yannakakis,et al.  A Note on Succinct Representations of Graphs , 1986, Inf. Control..

[13]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[14]  Venkatesh Raman,et al.  Succinct representation of balanced parentheses, static trees and planar graphs , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.