|
JAIST Repository >
School of Information Science >
Grants-in-aid for Scientific Research Papers >
FY 2016 >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/14310
|
| Title: | 幾何的な折りアルゴリズムの研究と開発 |
| Other Titles: | Research on geometric folding algorithms |
| Authors: | 上原, 隆平 |
| Authors(alternative): | Uehara, Ryuhei |
| Keywords: | Computational Origami Algorithm
Computational Geometry Folding and Unfolding
Polyhedron Polygon |
| Issue Date: | 30-May-2017 |
| Abstract: | 本研究期間を通じて，査読つき論文9編，審査つき国際会議18件を研究成果として発表した．またヨーロッパの理論計算機科学の最高峰の国際会議ICALPでの招待講演も行った．特に「一つの多角形から複数の凸多面体を折る」という興味深い性質をもつ展開図の研究と，「等間隔あるいはそれに準じる折り目の折り畳みの数え上げや列挙」という，計算折り紙の基礎研究について，大きな貢献ができた．また「折り紙の科学」をテーマとする国際会議の主催者の一人をつとめ，地元で「折り紙の科学」をテーマとするシンポジウムを開催したり，SSHの高校生グループと共同研究を行ってアメリカ機械学会で発表するなど，社会貢献にもつとめた．：In this period, I published 7 journal papers and 18 international conference papers. I also given an invited talk at ICALP, which is one of the top conferences of the theoretical computer science in Europe. Especially, I contributed the following two topics about computational origami: research on the relationship between a polygon and plural polyhedra that can be folded from the polygon, and research on the counting and enumeration for given crease patterns of uniform (or almost uniform) intervals. From the viewpoint of social contributions, I was a member of program committee of an international conference about Origami Science, and manage a local symposium about Origami Science. Moreover, I did a joint research with high school students in a Super Science High school, and it was presented at ASME, American Society of Mechanical Engineers. |
| Description: | 基盤研究(C)（一般）
研究期間：2014～2016
課題番号：26330009
研究者番号：00256471
研究分野：理論計算機科学 |
| Language: | jpn |
| URI: | http://hdl.handle.net/10119/14310 |
| Appears in Collections: | 2016年度 (FY 2016)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 26330009seika.pdf | | 264Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
