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

幾何的、組合せ的制約を有する三角形分割、静定グラフの生成手法の開発 建築への応用

Research Project

Project/Area Number 07J07910
Research Category

Grant-in-Aid for JSPS Fellows

Allocation TypeSingle-year Grants
Section国内
Research Field Fundamental theory of informatics
Research InstitutionKyoto University

Principal Investigator

谷川 眞一  Kyoto University, 工学研究科, 特別研究員(DC1)

Project Period (FY) 2007 – 2009
Project Status Completed (Fiscal Year 2009)
Budget Amount *help
¥2,800,000 (Direct Cost: ¥2,800,000)
Fiscal Year 2009: ¥900,000 (Direct Cost: ¥900,000)
Fiscal Year 2008: ¥900,000 (Direct Cost: ¥900,000)
Fiscal Year 2007: ¥1,000,000 (Direct Cost: ¥1,000,000)
Keywords列挙アルゴリズム / 無交差幾何グラフ / 剛性理論 / Molecular予想 / 木分割 / 計算幾何学 / 静定グラフ / 剛板ヒンジ構造 / Molecular Conjecture / 分子構造 / 三角形分割 / メカニズム設計
Research Abstract

研究計画で掲げた列挙アルゴリズム設計に取り組み,一定の成果を得た.昨年度我々が提案した辺制約付き辞書付き順序最大三角形分割という概念を用いることで,列挙対象となるグラフクラスの性質に依存しない一般的な枠組みの構築に成功した.
また組合せ剛性理論に関する研究でも大きな成果を得ることが出来た.特に重要な成果としてTayとWhiteleyによる剛板ヒンジ構造の組合せ論的剛性特徴付けの予想の解決が挙げられる.剛板ヒンジ構造物剛性の性質は共有結合で構成される分子構造の剛性と等価である事がCrapo and Whiteleyによって証明されており,剛板ヒンジ構造の剛性特徴付けを行うことによって,分子構造の剛性特徴付けが得られる.そのためTay-Whiteleyの予想は"Molecular Conjecture"と呼ばれており,応用の観点からも非常に重要であるにもかかわらず,25年余り未解決であった.我々はこの未解決問題を肯定的に解決した.
またグラフの木分割定理の一般化として,一様点要求を満たす根付き森分割が可能であるための必要十分条件を導出する事に成功した.今後この根付き森分割定理が構造物の剛性特徴付けに利用される予定である.

Report

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

    (37 results)

All 2010 2009 2008 2007

All Journal Article (18 results) (of which Peer Reviewed: 18 results) Presentation (19 results)

  • [Journal Article] A rooted forest partition with uniform vertex demand2010

    • Author(s)
      N.Katoh, S.Tanigawa
    • Journal Title

      Lecture Notes on Computer Science 5942

      Pages: 179-190

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] On the infinitesimal rigidity of bar-and-slider frameworks2009

    • Author(s)
      N.Katoh, S.Tanigawa
    • Journal Title

      Lecture Notes on Computer Science 5878

      Pages: 524-533

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Exact Algorithms for the Bottleneck Steiner Tree Problem2009

    • Author(s)
      S.W.Bae, S.C.Choi, C.S.Lee, S.Tanigawa
    • Journal Title

      Lecture Notes on Computer Science 5878

      Pages: 24-33

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Fast Enumeration Algorithms for Non-crossing Geometric Graphs2009

    • Author(s)
      N.Katoh, S.Tanigawa
    • Journal Title

      Discrete & Computational Geometry 42

      Pages: 443-468

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Enumerating edge -constrained triangulations and edge-constrained non-crossing geometric spanning trees2009

    • Author(s)
      N.Katoh, S.Tanigawa
    • Journal Title

      Discrete Applied Mathematics 157

      Pages: 3569-3585

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Enumeration of optimal pi-jointed bistable compliant mechanism2009

    • Author(s)
      N.Katoh, M.Ohsaki, T.Kinoshita, S.Tanigawa, D.Avis, I.Streinu
    • Journal Title

      Structural and Multidisciplinary Optimization 37

      Pages: 645-651

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A proof of the molecular conjecture2009

    • Author(s)
      N.Katoh, S.Tanigawa
    • Journal Title

      Proc.25th ACM Symposium on Computational Geometry 25

      Pages: 296-305

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Enumeration of Optimal Pin-jointed Bistable Compliant Mechanism2009

    • Author(s)
      N. Katoh, M. Ohsaki, T. Kinoshita, S. Tanigawa, D. Avis, I. Streinu
    • Journal Title

      Structural and Multidisciplinary Optimization

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Enumerating Edge-constrained Triangulations and Edge-constrained Non-crossing Spanning Trees2009

    • Author(s)
      N. Katoh, S. Tanigawa
    • Journal Title

      Discrete Applied Mathematics

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Fast Enumeration Algorithms for Non-crossing Geometric Graphs2009

    • Author(s)
      N. Katoh, S. Tanigawa
    • Journal Title

      Discrete and Computational Goemetry

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A Proof of the Molecular Conjecture2009

    • Author(s)
      N. Katoh, S. Tanigawa
    • Journal Title

      Proc. 25th ACM Symposium on Computational Geometry

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Enumerating Constrained Non-crossing Minimally Rigid Frameworks2008

    • Author(s)
      D. Avis, N. Katoh, M. Ohsaki, I. Streinu, S. Tanigawa
    • Journal Title

      Discrete & Computational Geometry 40[1]

      Pages: 31-46

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Geometric Spanner of Objects under L1 Distance2008

    • Author(s)
      Y. Zhu, J. Xu, Y. Yang, N. Katoh, S. Tanigawa
    • Journal Title

      Proc. 14th Annual International Computing and Combinatorics Conference, Springer-Verlag 5092

      Pages: 395-404

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Enumerating constrained non-crossing minimally rigid frameworks2008

    • Author(s)
      D.Avis, N.Katoh, M.Ohsaki, I.Streinu and S.Tanigawa
    • Journal Title

      Discrete & Computational Geometry (掲載決定)

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Fast Enumeration Algorithms for Non-crossing Geometric2008

    • Author(s)
      N.Katoh and S.Tanigawa
    • Journal Title

      Proc.24th ACM Symposium on Computational Geometry (SoCG'08) (掲載決定)

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Enumeration of optimal pin-jointed bistable compliant mechanisms with non-crossing members2008

    • Author(s)
      M.Ohsaki, N.Katoh, T.Kinoshita, S.Tanigawa, D.Avis and I.Streinu
    • Journal Title

      Structural and Multidisciplinary Optimization (掲載決定)

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Enumerating non-crossing minimally rigid frameworks2007

    • Author(s)
      D.Avis, N.Katoh, M.Ohsaki, I.Streinu and S.Tanigawa
    • Journal Title

      Graph and Combinatorics 23

      Pages: 117-134

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Enumerating Constrained Non-crossing Geometric Spanning Trees2007

    • Author(s)
      N.Katoh and S.Tanigawa
    • Journal Title

      Computing and Combinatorics, Lecture Notes in Computer Science 4598 4598

      Pages: 243-253

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Presentation] A rooted-forest partition with uniform vertex demand2010

    • Author(s)
      谷川眞一
    • Organizer
      The 4th international workshop on algorithms and computation
    • Place of Presentation
      Dhaka(バングラディシュ)
    • Year and Date
      2010-02-11
    • Related Report
      2009 Annual Research Report
  • [Presentation] On the infinitesimal rigidity of bar-and-slider frameworks2009

    • Author(s)
      谷川眞一
    • Organizer
      The 20th International Symposium on Algorithms and Computation
    • Place of Presentation
      Honolulu(アメリカ合衆国)
    • Year and Date
      2009-12-18
    • Related Report
      2009 Annual Research Report
  • [Presentation] 木詰込み定理による構造物剛性の特徴づけ2009

    • Author(s)
      谷川眞一
    • Organizer
      日本オペレーションズ・リサーチ学会KSMAP若手研究交流会
    • Place of Presentation
      明日香村
    • Year and Date
      2009-10-11
    • Related Report
      2009 Annual Research Report
  • [Presentation] 滑車付き平面トラス構造の剛性定理とラーマンの定理の証明2009

    • Author(s)
      谷川眞一
    • Organizer
      日本応用数理学会2009年度年会
    • Place of Presentation
      大阪大学
    • Year and Date
      2009-09-28
    • Related Report
      2009 Annual Research Report
  • [Presentation] 一様点要求を満たす根つき森分割と剛性理論への応用2009

    • Author(s)
      谷川眞一
    • Organizer
      電子情報通信学会コンピュテーション研究部会
    • Place of Presentation
      鳥取環境大学
    • Year and Date
      2009-09-14
    • Related Report
      2009 Annual Research Report
  • [Presentation] 剛板ヒンジ構造の組合せ剛性2009

    • Author(s)
      谷川眞一
    • Organizer
      日本建築学会大会
    • Place of Presentation
      東北学院大学
    • Year and Date
      2009-08-26
    • Related Report
      2009 Annual Research Report
  • [Presentation] On the Infinitesimal Rigidity of Bar-and-slider Frameworks2009

    • Author(s)
      谷川眞一
    • Organizer
      Canada-Japan Workshop on Discrete and Computational Geometry
    • Place of Presentation
      東京大学
    • Year and Date
      2009-07-14
    • Related Report
      2009 Annual Research Report
  • [Presentation] A proof of the molecular conjecture2009

    • Author(s)
      谷川眞一
    • Organizer
      The 25th ACM Symposium on Computational Geometry
    • Place of Presentation
      Aarhus, Denmark
    • Year and Date
      2009-06-10
    • Related Report
      2009 Annual Research Report
  • [Presentation] A proof of the molecular conjecture2009

    • Author(s)
      谷川眞一
    • Organizer
      The 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      Budapest, Hungary
    • Year and Date
      2009-05-19
    • Related Report
      2009 Annual Research Report
  • [Presentation] A Proof of the Molecular Conjecture2009

    • Author(s)
      谷川眞一
    • Organizer
      電子情報通信学会大会
    • Place of Presentation
      愛媛大学
    • Year and Date
      2009-03-19
    • Related Report
      2008 Annual Research Report
  • [Presentation] A Proof of the Molecular Conjecture2009

    • Author(s)
      谷川眞一
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      小樽商船大学
    • Year and Date
      2009-03-05
    • Related Report
      2008 Annual Research Report
  • [Presentation] Combinatorial Bar-slider Rigidity2008

    • Author(s)
      S. Tanigawa
    • Organizer
      The RIMS Workshop on Computational Geometry and Discrete Mathematics
    • Place of Presentation
      京都大学
    • Year and Date
      2008-10-16
    • Related Report
      2008 Annual Research Report
  • [Presentation] Enumerations of Non-crossing Geometric Graphs2008

    • Author(s)
      S. Tanigawa
    • Organizer
      The Acceleration and Visualization of Computation for Enumeration Problems
    • Place of Presentation
      京都大学
    • Year and Date
      2008-09-30
    • Related Report
      2008 Annual Research Report
  • [Presentation] 自由度kのメカニズムの生成2008

    • Author(s)
      谷川眞一
    • Organizer
      日本建築学会大会
    • Place of Presentation
      広島大学
    • Year and Date
      2008-09-18
    • Related Report
      2008 Annual Research Report
  • [Presentation] Fast enumeration algorithms for non-crossing geometric graphs2008

    • Author(s)
      S. Tanigawa
    • Organizer
      The 24th ACM Symposium on Computational Geometry
    • Place of Presentation
      Washington DC
    • Year and Date
      2008-06-11
    • Related Report
      2008 Annual Research Report
  • [Presentation] Enumerations of Non-crossing Geometric Graphs2008

    • Author(s)
      S. Tanigawa
    • Organizer
      The First Asian Association for Algorithms and Computation Annual Meeting (AAAC 2008)
    • Place of Presentation
      HongKong
    • Year and Date
      2008-04-26
    • Related Report
      2008 Annual Research Report
  • [Presentation] 無交差幾何グラフ列挙アルゴリズム2008

    • Author(s)
      谷川 眞一
    • Organizer
      電子情報通信学会大会
    • Place of Presentation
      北九州
    • Year and Date
      2008-03-18
    • Related Report
      2007 Annual Research Report
  • [Presentation] 必要部材制約付き平面無交差静定構造列挙アルゴリズム2007

    • Author(s)
      谷川 眞一
    • Organizer
      日本建築学会大会
    • Place of Presentation
      福岡
    • Year and Date
      2007-08-29
    • Related Report
      2007 Annual Research Report
  • [Presentation] Enumerating Constrained Non-crossing Geometric Spanning Trees2007

    • Author(s)
      S.Tanigawa
    • Organizer
      13th International Computing and Combinatorics Conference
    • Place of Presentation
      Banff,Canada
    • Year and Date
      2007-06-17
    • Related Report
      2007 Annual Research Report

URL: 

Published: 2007-04-01   Modified: 2024-03-26  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi