| Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2017: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2016: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2015: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
|
|---|
| Outline of Final Research Achievements |
The methodology for designing enumeration algorithms of geometric objects are discussed by integrating basic technologies (e.g., BDDs (Binary Decision Diagrams), ZDDs (Zero-suppressed BDDs) and reverse search). We also applied the methodology to various fields. First, we focused on enumerating the developments of orthogonal boxes. We introduced the notion of unit square development, and proposed an efficient algorithms for constructing ZDDs of the unit square developments. We also considered the problem from the reverse side. That is, we proposed algorithms checking whether a given orthogonal polygon can be folded into an orthogonal box (and giving the creases if possible). As for the application of our method, we have enumerated all patterns of partitions for elections within a disparity bound, and also all rhombille tilings.
|
