Geometric Folding Algorithms: Linkages, Origami, Polyhedra free videos and free material uploaded by Massachusetts Institute of Technology. This session contains about Geometric Folding Algorithms: Linkages, Origami, Polyhedra Updated syllabus , Lecture notes , videos , MCQ , Privious Question papers and Toppers Training Provided Training of this course. If Material not uploaded check another subject
This is an advanced class on computational geometry focusing on folding and unfolding of geometric structures including linkages, proteins, paper, and polyhedra. Examples of problems considered in this field include:
- What forms of origami can be designed automatically by algorithms?
- What shapes can result by folding a piece of paper flat and making one complete straight cut?
- What polyhedra can be cut along their surface and unfolded into a flat piece of paper without overlap?
- When can a linkage of rigid bars be untangled or folded into a desired configuration?
Many folding problems have applications in areas including manufacturing, robotics, graphics, and protein folding. This class covers many of the results that have been proved in the past few years, as well as the several exciting open problems that remain open.
This course focuses on the algorithms for analyzing and designing geometric foldings. Topics include reconfiguration of foldable structures, linkages made from one-dimensional rods connected by hinges, folding two-dimensional paper (origami), and unfolding and folding three-dimensional polyhedra. Applications to architecture, robotics, manufacturing, and biology are also covered in this course.
- 0 Reviews
- 1 Students
- 179 Courses
Write a public review