A New Development of Algorithms for Geometry Theorem Proving by Grobner Bases
| Project/Area Number |
22500004
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | University of Tsukuba |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥2,600,000 (Direct Cost: ¥2,000,000、Indirect Cost: ¥600,000)
Fiscal Year 2012: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2011: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2010: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Keywords | アルゴリズム / 数式処理 / 計算幾何 |
|---|
| Research Abstract |
We picked up several computational geometry problems, and among them, we succeeded in deriving new formulae for
(1) radius of inscribed polygons, and
(2) extension of Descartes circle theorem for Steiner n-cycles. We investigated both Grobner basis and resultant methods, and found the latter algorithm more effective for these problems. To our best knowledge, the obtained formulae are so complicated that they have never been computed before.
|
Report
(4 results)
Research Products
(17 results)
