A Compact Code for Rectangular Drawings with Degree Four Vertices

• Item type: Journal(1)
• 公開日: 2014-08-15
• タイトル: A Compact Code for Rectangular Drawings with Degree Four Vertices
• タイトル / 言語: en
• タイトル: A Compact Code for Rectangular Drawings with Degree Four Vertices
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: [一般論文（推薦論文）] rectangular drawing, floorplan, plane graph, encoding
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Institute of Natural Science and Technology, Academic Assembly, Niigata University
• 著者所属(英): en
• 著者所属(英): Institute of Natural Science and Technology, Academic Assembly, Niigata University
• 著者名: Toshihiko, Takahashi
• 著者名(英): Toshihiko, Takahashi
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: A subdivision of a rectangle into rectangular faces with horizontal and vertical line segments is called a rectangular drawing or floorplan. Several encodings of rectangular drawings have been published; however, most of them deal with rectangular drawings without vertices of degree four. Recently, Saito and Nakano developed two compact encodings for general rectangular drawings, that is, which allows vertices of degree four. The two encodings respectively need 6f - 2n4 + 6 bits and 5f -5 bits for rectangular drawings with f inner faces and n4 degree four vertices. The best encoding of the two depends on the number of vertices of degree four, that is, the former is the better if 2n4 > f+11; otherwise the latter is the better. In this paper, we propose a new encoding of general rectangular drawings with 5f - n4 - 6 bits for f ≥ 2, which is the most compact regardless of n4.; ------------------------------; 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.22(2014) No.4 (online); DOI http://dx.doi.org/10.2197/ipsjjip.22.634; ------------------------------
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: A subdivision of a rectangle into rectangular faces with horizontal and vertical line segments is called a rectangular drawing or floorplan. Several encodings of rectangular drawings have been published; however, most of them deal with rectangular drawings without vertices of degree four. Recently, Saito and Nakano developed two compact encodings for general rectangular drawings, that is, which allows vertices of degree four. The two encodings respectively need 6f - 2n4 + 6 bits and 5f -5 bits for rectangular drawings with f inner faces and n4 degree four vertices. The best encoding of the two depends on the number of vertices of degree four, that is, the former is the better if 2n4 > f+11; otherwise the latter is the better. In this paper, we propose a new encoding of general rectangular drawings with 5f - n4 - 6 bits for f ≥ 2, which is the most compact regardless of n4.; ------------------------------; 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.22(2014) No.4 (online); DOI http://dx.doi.org/10.2197/ipsjjip.22.634; ------------------------------
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 55, 号 8, 発行日 2014-08-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764