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

Designing highly functional and practical coding-algorithms of plane graphs

Research Project

Project/Area Number 23700012
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeMulti-year Fund
Research Field Fundamental theory of informatics
Research InstitutionIwate University

Principal Investigator

YAMANAKA Katsuhisa  岩手大学, 工学部, 助教 (60508836)

Project Period (FY) 2011 – 2012
Project Status Completed (Fiscal Year 2012)
Budget Amount *help
¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2012: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2011: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Keywordsアルゴリズム理論 / グラフ理論 / 符号化アルゴリズム
Research Abstract

In this research, we have designed some coding algorithms for important subclasses of plane graphs. First, we define a subclass of ordered trees which has a 1-to-1 correspondence to a class of rooted trees, and design a compact code for such ordered tree. For grid rectangular drawings and mosaic floorplans, which have applications to VLSI design, we proposed some compact codes. We also proposed a compact code for optimal ladder lotteries. Using the code, we give an upper bound for the number of optimal ladder lotteries.

Report

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

    (13 results)

All 2013 2012 2011

All Journal Article (4 results) (of which Peer Reviewed: 4 results) Presentation (9 results)

  • [Journal Article] A compact encoding of rectangular drawings with edge lengths, IEICE Transactions on Fundamentals of Electronics2013

    • Author(s)
      Shin-ichi Nakano and Katsuhisa Yama- naka
    • Journal Title

      Communications and Computer Sciences

      Volume: vol.E96-A(掲載決定)

    • Related Report
      2012 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 Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E29-A

    • NAID

      10031193786

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

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

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

      Volume: J94-D巻,12号 Pages: 2031-2036

    • NAID

      110008798721

    • URL

      http://search.ieice.org/bin/pdf.php?lang=J&year=2011&fname=j94-d_12_2031&abst=j

    • Related Report
      2012 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
      2011 Research-status Report
    • Peer Reviewed
  • [Presentation] Another optimal binary representtation of mosaic floorplans2013

    • Author(s)
      Katsuhisa Yamanaka and Shin-ichi Nakano
    • Organizer
      情報処理学会第144回アルゴリズム研究会
    • Place of Presentation
      小樽商科大学(北海道)
    • Year and Date
      2013-05-17
    • Related Report
      2012 Final Research Report
  • [Presentation] Coding ladder lotteries2013

    • Author(s)
      Tomoki Aiuchi, Katsuhisa Yamanaka, Takashi Hirayama, and Yasuaki Nishitani
    • Organizer
      European Workshop on Computational Geometory(EuroCG 2013)
    • Place of Presentation
      House of Science(ドイツ,ブラウンシュバイク)
    • Year and Date
      2013-03-19
    • Related Report
      2012 Final Research Report
  • [Presentation] Coding ladder lotteries2013

    • Author(s)
      Katsuhisa Yamanaka
    • Organizer
      European Workshop on Computational Geometory (EuroCG 2013)
    • Place of Presentation
      House of Science(ドイツ ブラウンシュバイク)
    • Related Report
      2012 Annual Research Report
  • [Presentation] Another optimal binary representation of mosaic floorplans2013

    • Author(s)
      Katsuhisa Yamanaka
    • Organizer
      情報処理学会 第144回アルゴリズム研究会
    • Place of Presentation
      小樽商科大学(北海道)
    • Related Report
      2012 Annual Research Report
  • [Presentation] Compact codes of rooted trees2012

    • Author(s)
      Katsuhisa Yamanaka
    • Organizer
      第25回回路とシステムワークショップ
    • Place of Presentation
      淡路国際夢舞台(兵庫県)(第25回回路とシステムワークショップ奨励賞受賞)
    • Year and Date
      2012-07-30
    • Related Report
      2012 Final Research Report
  • [Presentation] Coding ladder lotteries2012

    • Author(s)
      Katsuhisa Yamanaka
    • Organizer
      情報処理学会 第142回アルゴリズム研究会
    • Place of Presentation
      岩手大学(岩手県)
    • Related Report
      2012 Annual Research Report
  • [Presentation] Compact codes of rooted trees2012

    • Author(s)
      Katsuhisa Yamanaka
    • Organizer
      第25回 回路とシステムワークショップ
    • Place of Presentation
      淡路国際夢舞台(兵庫県)
    • Related Report
      2012 Annual Research Report
  • [Presentation] A compact encoding of rooted trees2012

    • Author(s)
      Katsuhisa Yamanaka
    • Organizer
      情報処理学会第138回アルゴリズム研究会 2012-AL-138-4
    • Place of Presentation
      流通科学大学(兵庫県)
    • Related Report
      2011 Research-status Report
  • [Presentation] A compact encoding of rectangular drawings with edge lengths2011

    • Author(s)
      Shin-ichi Nakano and Katsuhisa Yamanaka
    • Organizer
      情報処理学会第136回アルゴリズム研究会 2012-AL-136-1
    • Place of Presentation
      函館市中央図書館(北海道)
    • 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