Introduction to Computational Origami
摘要
In computational origami, the relationship between a polygon P and a polyhedron Q such that Q can be obtained by folding and gluing P is one of important topics. I give a brief survey of this topic including its history and recent results. Research on this topic needs mathematics and computation power. Recent developments of algorithms and data structure with supercomputer have drove us to the new world of folding and unfolding.