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

折り紙を中心とした剛体グラフ構造の複雑さの研究

Research Project

Project/Area Number 20650002
Research Category

Grant-in-Aid for Challenging Exploratory Research

Allocation TypeSingle-year Grants
Research Field Fundamental theory of informatics
Research InstitutionJapan Advanced Institute of Science and Technology

Principal Investigator

上原 隆平  北陸先端科学技術大学院大学, 情報科学研究科, 准教授 (00256471)

Project Period (FY) 2008 – 2010
Project Status Completed (Fiscal Year 2010)
Budget Amount *help
¥2,400,000 (Direct Cost: ¥2,400,000)
Fiscal Year 2010: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 2009: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 2008: ¥1,000,000 (Direct Cost: ¥1,000,000)
Keywords折り紙 / 剛体グラフ / グラフ理論 / アルゴリズム / 計算量の理論 / 剛体 / 展開図
Research Abstract

本研究テーマでは、折り紙に代表される「長さ」や「面積」などの属性を持つ素材を「物理的な構造をもっグラフ」としてモデル化し、コンピュータサイエンスの対象として研究を行った。そしてそのグラフ上の問題の複雑さを解析したり、効率のよいアルゴリズムを開発することを目的とした。そして平成22年度は以下の研究成果を得た。
1. Crease widthの提案と解析:紙を折ったとき、折り目に挟まる紙は少ないほどよい。この直観を問題として定式化し、crease widthという概念を提案した。そして数え上げの観点からcrease widthを研究し、与えられた折り目に矛盾しない折り方の個数に関する上界と下界を得た。
2. 展開図の研究:正多面体同士の間の共通の展開図を研究した。その結果、(1)辺による展開ではこうした展開図は得られないこと(2)多少の歪みを認めるなら、いくつかの多面体間の共通の展開図が作れること(3)極限として正四面体と立方体がどちらも折れる展開図が存在することなどを示した。
3. 折り紙における非決定性問題:折り紙の現実的なモデルにおいて、非常に基本的な問題が計算機では判定不能であることを証明した。
また、もう少し抽象的な構造を持ったグラフに関する理論的な研究成果もいくつか得ることができた。これらは適宜国際会議や論文誌に発表し「EATCS/LA Best Presentation Award」という賞も受賞した。挑戦的萌芽研究として十分な成果をあげることができた。

Report

(3 results)
  • 2010 Annual Research Report
  • 2009 Annual Research Report
  • 2008 Annual Research Report
  • Research Products

    (38 results)

All 2011 2010 2009 2008 Other

All Journal Article (18 results) (of which Peer Reviewed: 17 results) Presentation (17 results) Book (1 results) Remarks (2 results)

  • [Journal Article] Scale free properties of random k-trees2010

    • Author(s)
      C.Cooper , R.Uehara
    • Journal Title

      Mathematics in Computer Science

      Volume: 3 Pages: 489-496

    • NAID

      120002511578

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Random Generation and Enumeration of Proper Interval Graphs2010

    • Author(s)
      T.Saitoh, K.Yamanaka, M.Kiyomi, R.Uehara
    • Journal Title

      IEICE Transactions

      Volume: E93-D Pages: 1816-1823

    • NAID

      10027363849

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Enumeration of the Perfect Sequences of a Chordal Graph2010

    • Author(s)
      Y.Matsui, R.Uehara, T.Uno
    • Journal Title

      Theoretical Computer Science

      Volume: 411 Pages: 3635-3641

    • NAID

      110006792686

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Reconstruction of Interval Graphs2010

    • Author(s)
      M.Kiyomi, T.Saitoh, R.Uehara
    • Journal Title

      Theoretical Computer Science

      Volume: 411 Pages: 3859-3866

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] On the Complexity of Reconfiguration Problems2010

    • Author(s)
      T.Ito, E.D.Demaine, N.J.A.Harvey, C.H.Papadimitriou, M.Sideri, R.Uehara, Y.Uno
    • Journal Title

      Theoretical Computer Science

      Volume: 412 Pages: 1054-1065

    • NAID

      120003184349

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Algorithmic Folding Complexity2010

    • Author(s)
      J.Cardinal, E.D.Demaine, M.LDemaine, S.Imahori, T.Ito, MKiyomi, S.Langerman, R.Uehara, T.Uno
    • Journal Title

      Graphs and Combinatorics

      Volume: 27 Pages: 341-351

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Subexponential interval graphs generated by immigration-death process2010

    • Author(s)
      N.Miyoshi, M.Ogura, T.Shigezumi, R.Uehara
    • Journal Title

      Probability in the Engineering and Informational Science 24

      Pages: 289-301

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Efficient Enumeration of All Ladder Lotteries and Its Application2010

    • Author(s)
      K.Yamanaka, S.-i.Nakano, Y.Matsui, R.Uehara, K.Nakkada
    • Journal Title

      Theoretical Computer Science 411

      Pages: 1714-1722

    • NAID

      120002511577

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Scale free properties of random k-trees2010

    • Author(s)
      C.Cooper, R.Uehara
    • Journal Title

      Mathematics in Computer Science (印刷中)

    • NAID

      120002511578

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Random Generation and Enumeration of Proper Interval Graphs2010

    • Author(s)
      T.Saitoh, K.Yamanaka, M.Kiyomi, R.Uehara
    • Journal Title

      IEICE Transactions (掲載確定)

    • NAID

      10027363849

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Laminar Structure of Ptolemaic Graphs with Applications2009

    • Author(s)
      R.Uehara, Y.Uno
    • Journal Title

      Discrete Applied Mathematics 157(7)

      Pages: 1533-1543

    • NAID

      120002511581

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs2009

    • Author(s)
      S.Nakano, R.Uehara, T.Uno
    • Journal Title

      Journal of Computer Science and Technology 24(3)

      Pages: 517-533

    • NAID

      120002511580

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Scale Free Interval Graphs2009

    • Author(s)
      N.Miyoshi, T.Shigezumi, R.Uehara, O.Watanabe
    • Journal Title

      Theoretical Computer Science 410(45)

      Pages: 4533-4600

    • NAID

      120002511579

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article]2009

    • Author(s)
      R.Uehara, S.Teramoto
    • Journal Title

      ORIGAMI^4(A K Peters, Ltd.)

      Pages: 295-304

    • Related Report
      2009 Annual Research Report
  • [Journal Article] Complexity of Pleats Folding2009

    • Author(s)
      Tsuyoshi Ito, Masashi Kiyomi, Shinji Imahori, Ryuhei Uehara
    • Journal Title

      European Workshop on Computational Geometry (EuroCG 2009) 1

      Pages: 143-146

    • NAID

      110007123963

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Efficient Enumeration of All Pseudoline Arrangements2009

    • Author(s)
      Katsuhisa Yamanaka, Shinichi Nakano, Yasuko Matsui, Ryuhei Uehara, Ken to Nakada
    • Journal Title

      European Workshop on Computational Geometry (EuroCG 2009) 1

      Pages: 53-56

    • NAID

      110007995562

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Inverting Linkages with stretch2009

    • Author(s)
      Yoichi Fujimoto, Mitsuo Motoki, Ryuhei Uehara
    • Journal Title

      Canadian Conference on Computational Geometry (CCCG 2008) 1

      Pages: 31-34

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Polygons Folding to Plural Incongruent Orthogonal Boxes2009

    • Author(s)
      Jun Mitani, Ryuhei Uehara
    • Journal Title

      Canadian Conference on Computational Geometry (CCCG 2008) 1

      Pages: 39-42

    • NAID

      110007081785

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Presentation] Construct of Common Development of Regular Tetrahedron and Cube2011

    • Author(s)
      T.Shirakawa, T.Horiyama, R.Uehara
    • Organizer
      27th European Workshop on Computational Geometry(EuroCG 2011)
    • Place of Presentation
      スイス・モルシャッハ
    • Year and Date
      2011-03-29
    • Related Report
      2010 Annual Research Report
  • [Presentation] Nonexistence of Common Edge Developments of Regular Tetrahedron and Other Platonic Solids2010

    • Author(s)
      T.Horiyama , R.Uehara
    • Organizer
      China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010)
    • Place of Presentation
      中国・大連
    • Year and Date
      2010-11-04
    • Related Report
      2010 Annual Research Report
  • [Presentation] Simple Undecidable Problem on Origami2010

    • Author(s)
      R.Uehara
    • Organizer
      China-Japan Joint Conference on Computational Geometry, Graphs and Applicat-ions (CGGA 2010)
    • Place of Presentation
      中国・大連
    • Year and Date
      2010-11-04
    • Related Report
      2010 Annual Research Report
  • [Presentation] On Stretch Minimization Problem on Unit Strip Paper2010

    • Author(s)
      R.Uehara
    • Organizer
      The 22nd Canadian Conference on Computational Geometry (CCCG 2010)
    • Place of Presentation
      カナダ・マニトバ
    • Year and Date
      2010-08-11
    • Related Report
      2010 Annual Research Report
  • [Presentation] Any Monotone Function is Realized by Interlocked Polygons2010

    • Author(s)
      E.D.Demaine, M.L.Demaine, R.Uehara
    • Organizer
      The 22nd Canadian Conference on Computational Geometry (CCCG 2010)
    • Place of Presentation
      カナダ・マニトバ
    • Year and Date
      2010-08-10
    • Related Report
      2010 Annual Research Report
  • [Presentation] Stretch Minimization Problem of a Strip Paper2010

    • Author(s)
      R.Uehara
    • Organizer
      5th International Conference on Origami in Science, Mathematics and Education (50SME)
    • Place of Presentation
      シンガポール・シンガポール経済大学
    • Year and Date
      2010-07-14
    • Related Report
      2010 Annual Research Report
  • [Presentation] Kaboozle is NP-complete, even in a Strip Form2010

    • Author(s)
      T.Asano, E.Demaine, M.Demaine R.Uehara
    • Organizer
      5th International Conference on FUN WITH ALGORITHMS
    • Place of Presentation
      イタリア・イスキア島
    • Year and Date
      2010-06-02
    • Related Report
      2010 Annual Research Report
  • [Presentation] Reconstruction Algorithm for Permutation Graphs2010

    • Author(s)
      M.Kiyomi, T.Saitoh, R.Uehara
    • Organizer
      Annual Workshop on Algorithms and Computation
    • Place of Presentation
      ダッカ、バングラデシュ
    • Year and Date
      2010-02-10
    • Related Report
      2009 Annual Research Report
  • [Presentation] Random Generation and Enumeration of Bipartite Permutation Graphs2009

    • Author(s)
      T.Saitoh, Y.Otachi, K.Yamanaka, R.Uehara
    • Organizer
      International Symposium on Algorithms and Computation
    • Place of Presentation
      ハワイ、アメリカ
    • Year and Date
      2009-12-18
    • Related Report
      2009 Annual Research Report
  • [Presentation] Route-Enabling Graph Orientation Problems2009

    • Author(s)
      T.Ito, Y.Miyamoto, H.Ono, H.Tamaki, R.Uehara
    • Organizer
      International Symposium on Algorithms and Computation
    • Place of Presentation
      ハワイ、アメリカ
    • Year and Date
      2009-12-16
    • Related Report
      2009 Annual Research Report
  • [Presentation] Algorithmic Folding Complexity2009

    • Author(s)
      J.Cardinal, E.Demaine, M.Demaine, S.Imahori, S.Langerman, R.Uehara
    • Organizer
      International Symposium on Algorithms and Computation
    • Place of Presentation
      ハワイ、アメリカ
    • Year and Date
      2009-12-16
    • Related Report
      2009 Annual Research Report
  • [Presentation] How to make a picturesque maze2009

    • Author(s)
      Y.Okamoto, R.Uehara
    • Organizer
      Canadian Conference on Computational Geometry
    • Place of Presentation
      バンクーバー、カナダ
    • Year and Date
      2009-08-18
    • Related Report
      2009 Annual Research Report
  • [Presentation] Reconstruction of Interval Graphs2009

    • Author(s)
      M.Kiyomi, T.Saitoh, R.Uehara
    • Organizer
      Annual International Computing and Combinatorics Conference
    • Place of Presentation
      ナイアガラ、アメリカ
    • Year and Date
      2009-07-13
    • Related Report
      2009 Annual Research Report
  • [Presentation] Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes2009

    • Author(s)
      Y.Okamoto, R.Uehara, T.Uno
    • Organizer
      International Workshop on Graph-Theoretic Concepts in Computer Science
    • Place of Presentation
      モンペリエ、フランス
    • Year and Date
      2009-06-26
    • Related Report
      2009 Annual Research Report
  • [Presentation] Complexity of Pleats Folding2009

    • Author(s)
      伊藤剛志, 清見礼, 今堀慎治, 上原隆平
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      NTTコミュニケーション科学基礎研究所(厚木)
    • Year and Date
      2009-01-30
    • Related Report
      2008 Annual Research Report
  • [Presentation] 折り紙の計算論的複雑さの研究(招待講演)2008

    • Author(s)
      上原隆平
    • Organizer
      日本機械学会RC235 計算力学援用による折紙工学の推進とその応用に関する調査研究分科会
    • Place of Presentation
      東京工業大学
    • Year and Date
      2008-10-07
    • Related Report
      2008 Annual Research Report
  • [Presentation] Polygons Folding to Plural0 Incongruent Orthogonal Boxes2008

    • Author(s)
      三谷純, 上原隆平
    • Organizer
      電子情報通信学会コンピュテーシヨン研究会
    • Place of Presentation
      名古屋工業大学
    • Year and Date
      2008-09-11
    • Related Report
      2008 Annual Research Report
  • [Book] 幾何的な折りアルゴリズム2009

    • Author(s)
      E.D.ドメイン、J.オルーク(著)、上原隆平(訳)
    • Total Pages
      520
    • Publisher
      近代科学社
    • Related Report
      2009 Annual Research Report
  • [Remarks]

    • URL

      http://www.jaist.ac.jp/~uehara/pub/index.html

    • Related Report
      2010 Annual Research Report
  • [Remarks]

    • URL

      http://www.jaist.ac.jp/~uehara

    • Related Report
      2009 Annual Research Report

URL: 

Published: 2008-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi