• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Compact data structures for plane structures

Research Project

Project/Area Number 23500005
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeMulti-year Fund
Section一般
Research Field Fundamental theory of informatics
Research InstitutionGunma University

Principal Investigator

NAKANO Shin-ichi  群馬大学, 理工学研究院, 教授 (30227855)

Project Period (FY) 2011 – 2013
Project Status Completed (Fiscal Year 2013)
Budget Amount *help
¥5,070,000 (Direct Cost: ¥3,900,000、Indirect Cost: ¥1,170,000)
Fiscal Year 2013: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2012: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2011: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
Keywordsアルゴリズム / グラフ / 符号 / 平面グラフ / データ構造
Research Abstract

Even though the performance of computers always increase rapidly, the amount of data increase more rapidly. So we need compact representations for data to store them in computers.
In this research we design new compact data structures for huge size of plane structures, especially floorplans. A Floorplan is a partition of a rectangle into several rectangles. Floorplans are important model used in VLSI design.

Report

(4 results)
  • 2013 Annual Research Report   Final Research Report ( PDF )
  • 2012 Research-status Report
  • 2011 Research-status Report
  • Research Products

    (42 results)

All 2014 2013 2012 2011

All Journal Article (21 results) (of which Peer Reviewed: 21 results) Presentation (17 results) Book (4 results)

  • [Journal Article] Efficient Enumeration of All Ladder Lotteries with k Bars2014

    • Author(s)
      Katsuhisa Yamanaka and Shin-Ichi Nakano
    • Journal Title

      電子情報通信学会英文論文誌, IEICE TRANS. FUNDAMENTALS, Special Section on Discrete Mathematics and Its Applications

      Volume: Vol.E97-A, no.6 Pages: 1163-1170

    • NAID

      130004770844

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] A Compact Encoding of Rectangular Drawings with Edge Lengths2013

    • Author(s)
      Shin-Ichi Nakano and Katsuhisa Yamanaka
    • Journal Title

      電子情報通信学会英文論文誌, IEICE TRANS. FUNDAMENTALS, Special Section, Discrete Mathematics and Its Applications

      Volume: Vol.E96-A, no.6 Pages: 1032-1035

    • NAID

      10031193786

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression2013

    • Author(s)
      Takeaki Uno, Ryuhei Uehara and Shin-ichi Nakano
    • Journal Title

      Discrete Mathematics, Algorithms and Applications (DMAA)

      Volume: Vol.05, No.2

    • NAID

      120005367953

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] Two Compact Codes for Rectangular Drawings with Degree Four Vertices2013

    • Author(s)
      Masashi Saito and Shin-ichi Nakano
    • Journal Title

      Journal of Information Processing

      Volume: Vol.21, No.4 Pages: 660-664

    • NAID

      130003384025

    • Related Report
      2013 Annual Research Report 2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] 格子L 字描画のコンパクトな符号2013

    • Author(s)
      斎藤雅士, 中野眞一
    • Journal Title

      電子情報通信学会論文誌D

      Volume: Vol.J96-D, no.9 Pages: 2041-2046

    • NAID

      110009657500

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] 指定した次数列をもつ順序なし木の高速列挙2013

    • Author(s)
      石川雅信, 中野眞一
    • Journal Title

      電子情報通信学会論文誌D

      Volume: Vol.J96-D, no.11 Pages: 2710-2715

    • NAID

      110009661661

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] 指定した次数列をもつ連結外平面グラフの列挙2013

    • Author(s)
      金井祐一, 中野眞一
    • Journal Title

      電子情報通信学会論文誌A

      Volume: Vol.J96-A, no.9 Pages: 643-649

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] A Compact Encoding of Rectangular Drawings with Edge Lengths2013

    • Author(s)
      Shin-Ichi Nakano and Katsuhisa Yamanaka
    • Journal Title

      電子情報通信学会英文論文誌

      Volume: E96-A Pages: 1032-1035

    • NAID

      10031193786

    • Related Report
      2013 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 格子L字描画のコンパクトな符号2013

    • Author(s)
      斎藤雅士, 中野眞一
    • Journal Title

      電子情報通信学会論文誌

      Volume: J96-D Pages: 2041-2046

    • NAID

      110009657500

    • Related Report
      2013 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A Compact Encoding of Rectangular Drawings with Edge Lengths2013

    • Author(s)
      K. Yamanaka and S. Nakano
    • Journal Title

      IEICE TRANS. FUNDAMENTALS, Special Section, Discrete Mathematics and Its Applications,

      Volume: E96-A

    • NAID

      10031193786

    • Related Report
      2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] 格子L字描画のコンパクトな符号2013

    • Author(s)
      斎藤雅士, 中野眞一
    • Journal Title

      電子情報通信学会論文誌D

      Volume: Vol.J96-D

    • NAID

      110009657500

    • Related Report
      2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] Enumerating All Rooted Trees including k Leaves2012

    • Author(s)
      M. Ishikawa, K. Yamanaka, Y. Otachi and S. Nakano
    • Journal Title

      電子情報通信学会英文論文誌, IEICE TRANS. INF.& SYST., Special issue on Foundations of Computer Science

      Volume: Vol.E95-D, no.3 Pages: 763-768

    • NAID

      10030611576

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] Efficient Enumeration of Ordered Trees with k leaves2012

    • Author(s)
      Katsuhisa Yamanaka, Yota Otachi and Shin-Ichi Nakano
    • Journal Title

      Theoretical Computer Science

      Volume: Vol.442 Pages: 22-27

    • NAID

      110006980259

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] Efficient Enumeration of Ordered Trees with k leaves2012

    • Author(s)
      K. Yamanaka, Y. Otachi and S. Nakano
    • Journal Title

      Theoretical Computer Science

      Volume: 442 Pages: 22-27

    • NAID

      110006980259

    • Related Report
      2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] Enumerating All Rooted Trees including k Leaves2012

    • Author(s)
      M. Ishikawa, K. Yamanaka, Y. Otachi and S. Nakano
    • Journal Title

      IEICE TRANS. INF.& SYST.

      Volume: E95-D Pages: 763-768

    • NAID

      10030611576

    • Related Report
      2011 Research-status Report
    • Peer Reviewed
  • [Journal Article] Listing All st-Orientations2011

    • Author(s)
      Andry Setiawan and Shin-ichi Nakano
    • Journal Title

      電子情報通信学会英文論文誌A, IEICE TRANS. FUNDAMENTALS

      Volume: Vol.E94-A, no.10 Pages: 1965-1970

    • NAID

      110007338433

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] 格子方形描画のコンパクトな符号2011

    • Author(s)
      須田亮平, 中野眞一, 山中克久
    • Journal Title

      電子情報通信学会論文誌D

      Volume: Vol.J94-D, no.12 Pages: 2031-2036

    • NAID

      110008798721

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] Listing All st-Orientations2011

    • Author(s)
      Andry Setiawan and Shin-ichi Nakano
    • Journal Title

      IEICE TRANS. FUNDAMENTALS

      Volume: E94-A Pages: 1965-1970

    • NAID

      110007338433

    • Related Report
      2011 Research-status Report
    • Peer Reviewed
  • [Journal Article] 格子方形描画のコンパクトな符号2011

    • Author(s)
      須田亮平,中野眞一,山中克久
    • Journal Title

      電子情報通信学会論文誌D

      Volume: J94-D Pages: 1965-1970

    • NAID

      110008798721

    • Related Report
      2011 Research-status Report
    • Peer Reviewed
  • [Journal Article] A Compact encoding of Unordered Binary Trees2011

    • Author(s)
      Kozue Iwata, Shiro Ishiwata and Shin-ichi Nakano
    • Journal Title

      Proc. of TAMC2011

      Volume: LNCS 6648 Pages: 106-113

    • Related Report
      2011 Research-status Report
    • Peer Reviewed
  • [Journal Article] Bounding the number of reduced trees, cographs and series-parallel graphs by compression2011

    • Author(s)
      Takeaki Uno, Ryuhei Uehara and Shin-Ichi Nakano
    • Journal Title

      Proc. of WALCOM 2012

      Volume: LNCS 7157 Pages: 5-16

    • NAID

      120005367953

    • Related Report
      2011 Research-status Report
    • Peer Reviewed
  • [Presentation] A New Compact Encoding of Rectangular Drawings2013

    • Author(s)
      斎川勇人, 中野眞一
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      福島県飯坂温泉
    • Year and Date
      2013-03-01
    • Related Report
      2013 Final Research Report
  • [Presentation] Another Optimal Binary Representation of Mosaic Floorplans2013

    • Author(s)
      山中克久, 中野眞一
    • Organizer
      情 報処理学会アルゴリズム研究会
    • Place of Presentation
      小樽商科大学
    • Related Report
      2013 Final Research Report
  • [Presentation] On (k, r(f))-gatherings on a Road2013

    • Author(s)
      Toshihiro Akagi and Shin-Ichi Nakano
    • Organizer
      JCDCGG 2013
    • Place of Presentation
      東京理科大
    • Related Report
      2013 Final Research Report
  • [Presentation] A New Compact Encoding of Rectangular Drawings2013

    • Author(s)
      Yuto Saikawa and Shin-Ichi Nakano
    • Organizer
      JCDCGG 2013
    • Place of Presentation
      東京理科大
    • Related Report
      2013 Final Research Report
  • [Presentation] Uniformly Random Generation of Floorplans2013

    • Author(s)
      山中克久, 中野眞一
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      花巻
    • Related Report
      2013 Annual Research Report 2013 Final Research Report
  • [Presentation] Another Optimal Binary Representation of Mosaic Floorplans2013

    • Author(s)
      山中克久, 中野眞一
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      小樽商科大学
    • Related Report
      2013 Annual Research Report 2012 Research-status Report
  • [Presentation] A New Compact Encoding of Rectangular Drawings2013

    • Author(s)
      Yuto Saikawa and Shin-Ichi Nakano
    • Organizer
      国際会議JCDCGG
    • Place of Presentation
      東京理科大学
    • Related Report
      2013 Annual Research Report
  • [Presentation] A New Compact Encoding of Rectangular Drawings2013

    • Author(s)
      斎川勇人, 中野眞一
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      福島市
    • Related Report
      2012 Research-status Report
  • [Presentation] Two Compact Codes for Rectangular Drawings with Degree Four Vertices2012

    • Author(s)
      Masashi Saito and Shin-ichi Nakano
    • Organizer
      FIT 2012
    • Place of Presentation
      法政大学
    • Year and Date
      2012-09-04
    • Related Report
      2013 Final Research Report
  • [Presentation] 大規模グラフのspanner を生成するストリーミングアルゴリズムの実装2012

    • Author(s)
      石島正大・中野眞一
    • Organizer
      FIT 2012
    • Place of Presentation
      法政大学
    • Year and Date
      2012-09-04
    • Related Report
      2013 Final Research Report
  • [Presentation] L 字形描画のコンパクトな符号2012

    • Author(s)
      Md. Rezaul Karim, 中野眞一, Md. Saidur Rahman
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      愛媛大
    • Year and Date
      2012-05-14
    • Related Report
      2013 Final Research Report
  • [Presentation] Two Compact Codes for Rectangular Drawings with Degree Four Vertices2012

    • Author(s)
      Masashi Saito and Shin-ichi Nakano
    • Organizer
      第11回情報科学技術フォーラム
    • Place of Presentation
      法政大学
    • Related Report
      2012 Research-status Report
  • [Presentation] 大規模グラフのspannerを生成するストリーミングアルゴリズムの実装2012

    • Author(s)
      石島 正大・中野 眞一
    • Organizer
      第11回情報科学技術フォーラム
    • Place of Presentation
      法政大学
    • Related Report
      2012 Research-status Report
  • [Presentation] On the number of reduced trees, cographs, and series-parallel graphs by compression2011

    • Author(s)
      Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      山口大
    • Year and Date
      2011-11-18
    • Related Report
      2013 Final Research Report
  • [Presentation] A Compact Encoding of Rectangular Drawings with Edge Lengths2011

    • Author(s)
      中野眞一, 山中克久
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      函館市中央図書館
    • Year and Date
      2011-09-06
    • Related Report
      2013 Final Research Report
  • [Presentation] A Compact Encoding of Rectangular Drawings with Edge Lengths2011

    • Author(s)
      中野眞一, 山中克久
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      函館
    • Related Report
      2011 Research-status Report
  • [Presentation] On the number of reduced trees, cographs,and series-parallel graphs by compression2011

    • Author(s)
      Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      山口大
    • Related Report
      2011 Research-status Report
  • [Book] WALCOM : Algorithms and Computation Sixth International Workshop, WALCOM 2012, Dhaka, Bangladesh, Proceedings, Lecture Notes in Computer Science2012

    • Author(s)
      Shin-ichi Nakano, Md. Saidur Rahman
    • Related Report
      2013 Final Research Report
  • [Book] Proc of WALCOM 20122012

    • Author(s)
      Shin-ichi Nakano, Md. Saidur Rahman
    • Total Pages
      241
    • Publisher
      Springer
    • Related Report
      2011 Research-status Report
  • [Book] Algorithms and Computation 22nd International Symposium, ISAAC 2011 Yokohama, Japan, Proceedings Lecture Notes in Computer Science, ARCoSS2011

    • Author(s)
      Takao Asano, Shin-ichi Nakano, Yoshio Okamoto and Osamu Watanabe
    • Related Report
      2013 Final Research Report
  • [Book] Proc. of ISAAC20112011

    • Author(s)
      T. Asano, S. Nakano, Y. Okamoto and O. Watanabe
    • Total Pages
      775
    • Publisher
      Springer
    • Related Report
      2011 Research-status Report

URL: 

Published: 2011-08-05   Modified: 2019-07-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi