L字形描画のコンパクトな符号

• Item type: SIG Technical Reports(1)
• 公開日: 2012-05-07
• タイトル: L字形描画のコンパクトな符号
• タイトル / 言語: en
• タイトル: Compact Codes for <i>L</i>-floorplans
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: Dept. of Computer Science and Engineering, University of Dhaka
• 著者所属: Dept. of Computer Science, Gunma University, Japan
• 著者所属: Dept. of Computer Science and Engineering, Bangladesh University of Engineering and Technology(BUET)
• 著者所属(英): en
• 著者所属(英): Dept. of Computer Science and Engineering, University of Dhaka
• 著者所属(英): en
• 著者所属(英): Dept. of Computer Science, Gunma University, Japan
• 著者所属(英): en
• 著者所属(英): Dept. of Computer Science and Engineering, Bangladesh University of Engineering and Technology(BUET)
• 著者名: Md.RezaulKarim; Shin-ichiNakano; Md.SaidurRahman
• 著者名(英): Md., RezaulKarim; Shin-ichi, Nakano; Md., SaidurRahman
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: A floorplan is a partition of a rectangle into a set of rectilinear polygons. An L-floorplan is a floorplan where each rectilinear polygon is either a rectangle or an L-shape polygon. Floorplans have many important applications including VLSI layout. Since the size of floorplans may be huge, compact encodings of floorplans are desired. Several compact encodings of floorplans are known where each rectilinear polygon is a rectangle only. In this paper we design two compact encodings for L-floorplans with 6f +3L+2n2-2 and 5f +6L-4 bits, respectively, where f is the number of polygons, L is the number of L-shape polygons and n2 is the number of vertices with degree 2. The encoding techniques are simple and both encoding and decoding can be performed in O(f) = O(n) time.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: A floorplan is a partition of a rectangle into a set of rectilinear polygons. An L-floorplan is a floorplan where each rectilinear polygon is either a rectangle or an L-shape polygon. Floorplans have many important applications including VLSI layout. Since the size of floorplans may be huge, compact encodings of floorplans are desired. Several compact encodings of floorplans are known where each rectilinear polygon is a rectangle only. In this paper we design two compact encodings for L-floorplans with 6f +3L+2n2-2 and 5f +6L-4 bits, respectively, where f is the number of polygons, L is the number of L-shape polygons and n2 is the number of vertices with degree 2. The encoding techniques are simple and both encoding and decoding can be performed in O(f) = O(n) time.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN1009593X
• 書誌情報: 研究報告アルゴリズム（AL）; 巻 2012-AL-140, 号 1, p. 1-7, 発行日 2012-05-07
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会