Another Optimal Binary Representation of Mosaic Floorplans

スポンサーリンク

概要

• 論文の詳細を見る

• Recently a compact code of mosaic floorplans with f inner face was proposed by He. The length of the code is 3 f - 3 bits and asymptotically optimal. In this paper we propose a new code of mosaic floorplans with f inner faces including k boundary faces. The length of our code is at most 3 f - k/2 - 1 bits. Hence our code is shorter than or equal to the code by He, except for few small floorplans with k = f ≦ 3. Coding and decoding can be done in O(f) time.

• 2013-05-10

著者

• Katsuhisa Yamanaka

  Department Of Electrical Engineering And Computer Science Iwate University

• Katsuhisa Yamanaka

  Department of Electrical Engineering and Computer Science, Iwate University

関連論文

• A Compact Encoding of Rectangular Drawings with Edge Lengths
• Coding Ladder Lotteries
• Another Optimal Binary Representation of Mosaic Floorplans
• Uniformly Random Generation of Floorplans

スポンサーリンク