WEKO3
アイテム
A New Compact Encoding of Rectangular Drawings
https://ipsj.ixsq.nii.ac.jp/records/90408
https://ipsj.ixsq.nii.ac.jp/records/904087e06a996-030b-4019-a90e-11ece6383d3d
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-AL13143004.pdf (573.3 kB)
|
Copyright (c) 2013 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | SIG Technical Reports(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2013-02-22 | |||||||
| タイトル | ||||||||
| タイトル | A New Compact Encoding of Rectangular Drawings | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | A New Compact Encoding of Rectangular Drawings | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_18gh | |||||||
| 資源タイプ | technical report | |||||||
| 著者所属 | ||||||||
| 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 | ||||||||
| 著者名 |
Yuto, Saikawa
× Yuto, Saikawa
|
|||||||
| 著者名(英) |
Yuto, Saikawa
× Yuto, Saikawa
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | A rectangular drawing is a plane drawing of a graph in which every face is a rectangle. Rectangular drawings have an application for floorplans, which may have a huge number of faces, so a compact code to store the drawings is desired. The most compact code for rectangular drawings needs 4f - 4 bits, where f is the number of inner faces of the drawing. In this paper we design a new simple and compact code for rectangular drawings. The code needs 4f - 3 - B bits for each rectangular drawing, where B is the number of inner faces having bottom line segments on the bottommost horizontal line segment. Since B ≧ 1 holds, the length of our new code is at most 4f - 4 bits. Our encoding and decoding algorithms run in O(f) time. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | A rectangular drawing is a plane drawing of a graph in which every face is a rectangle. Rectangular drawings have an application for floorplans, which may have a huge number of faces, so a compact code to store the drawings is desired. The most compact code for rectangular drawings needs 4f - 4 bits, where f is the number of inner faces of the drawing. In this paper we design a new simple and compact code for rectangular drawings. The code needs 4f - 3 - B bits for each rectangular drawing, where B is the number of inner faces having bottom line segments on the bottommost horizontal line segment. Since B ≧ 1 holds, the length of our new code is at most 4f - 4 bits. Our encoding and decoding algorithms run in O(f) time. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AN1009593X | |||||||
| 書誌情報 |
研究報告アルゴリズム（AL） 巻 2013-AL-143, 号 4, p. 1-4, 発行日 2013-02-22 |
|||||||
| Notice | ||||||||
| SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. | ||||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
