WEKO3
アイテム
Two Compact Codes for Rectangular Drawings with Degree Four Vertices
https://ipsj.ixsq.nii.ac.jp/records/95423
https://ipsj.ixsq.nii.ac.jp/records/954232037dcdd-db5b-4f5e-b375-c90a5a7376de
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5410001 (467.4 kB)
|
Copyright (c) 2013 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2013-10-15 | |||||||||
| タイトル | ||||||||||
| タイトル | Two Compact Codes for Rectangular Drawings with Degree Four Vertices | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Two Compact Codes for Rectangular Drawings with Degree Four Vertices | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [一般論文(推薦論文)] coding, tree, rectangular drawing, depth first search | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| Department of Computer Science, Gunma Univercity | ||||||||||
| 著者所属 | ||||||||||
| Department of Computer Science, Gunma Univercity | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Department of Computer Science, Gunma Univercity | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Department of Computer Science, Gunma Univercity | ||||||||||
| 著者名 |
Masashi, Saito
× Masashi, Saito
× Shin-ichiNakano
|
|||||||||
| 著者名(英) |
Masashi, Saito
× Masashi, Saito
× Shin-ichi, Nakano
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | A rectangular drawing is a partition of a rectangle into a set of rectangles. Rectangular drawings have many important applications including VLSI layout. Since the size of rectangular drawings may be huge, compact encodings are desired. Several compact encodings of rectangular drawings without degree four vertices are known. In this paper, we design two compact encodings for rectangular drawings with degree four vertices. We give 5f-B-n4 bits and 5f-B-W-3 bits encodings for rectangular drawings, where f is the number of inner faces, n4 is the number of vertices with degree four, and B (resp. W) is the number of inner faces touching the bottommost horizontal (resp. rightmost vertical) line segments. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.21(2013) No.4 (online) DOI http://dx.doi.org/10.2197/ipsjjip.21.660 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | A rectangular drawing is a partition of a rectangle into a set of rectangles. Rectangular drawings have many important applications including VLSI layout. Since the size of rectangular drawings may be huge, compact encodings are desired. Several compact encodings of rectangular drawings without degree four vertices are known. In this paper, we design two compact encodings for rectangular drawings with degree four vertices. We give 5f-B-n4 bits and 5f-B-W-3 bits encodings for rectangular drawings, where f is the number of inner faces, n4 is the number of vertices with degree four, and B (resp. W) is the number of inner faces touching the bottommost horizontal (resp. rightmost vertical) line segments. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.21(2013) No.4 (online) DOI http://dx.doi.org/10.2197/ipsjjip.21.660 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 54, 号 10, 発行日 2013-10-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
