• No products in the cart.

Algorithms are used in different ways such as analyzing and designing geometric folding. Learning that your algorithm knowledge is useful should motivate you to keep in improving so you can use it in different ways efficiently.

You will be provided in this [course_title] knowledge of reconfiguration of foldable structures, linkages, and other materials. Applications of the algorithm can be used to the fields of architecture, robotics, manufacturing, and biology.

### Assessment

This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer needs to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.

### Certification

Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of the assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.

Having an Official Edukite Certification is a great way to celebrate and share your success. You can:

• Show it to prove your success

Course Credit: MIT

### Course Curriculum

 Module: 1 Lecture 1: Overview 01:20:00 Lecture 2: Simple Folds 01:23:00 Lecture 3: Single-Vertex Crease Patterns 01:23:00 Lecture 4: Efficient Origami Design 01:26:00 Lecture 5: Artistic Origami Design 01:26:00 Lecture 6: Architectural Origami 01:18:00 Lecture 7: Origami is Hard 01:22:00 Lecture 8: Fold & One Cut 01:21:00 Lecture 9: Pleat Folding 01:23:00 Lecture 10: Kempe’s Universality Theorem 01:18:00 Lecture 11: Rigidity Theory 01:24:00 Lecture 12: Tensegrities & Carpenter’s Rules 01:24:00 Lecture 13: Locked Linkages 01:22:00 Lecture 14: Hinged Dissections 00:53:00 Lecture 15: General & Edge Unfolding 01:21:00 Lecture 16: Vertex & Orthogonal Unfolding 01:22:00 Lecture 17: Alexandrov’s Theorem 01:21:00 Lecture 18: Gluing Algorithms 01:21:00 Lecture 19: Refolding & Smooth Folding 01:25:00 Lecture 20: Protein Chains 01:19:00 Lecture 21: HP Model & Interlocked Chains 01:10:00 Module: 2 Class 1: Overview 00:51:00 Class 2: Univeresality & Simple Folds 00:53:00 Class 3: Single-Vertex Crease Patterns 00:46:00 Class 4: Efficient Origami Design 00:49:00 Class 5: Tessellations & Modulars 00:38:00 Class 6: Architectural Origami 00:45:00 Class 7: Origami is Hard 00:50:00 Class 8: Fold & One Cut 00:50:00 Class 9: Pleat Folding 00:46:00 Class 10: Kempe’s Universality Theorem 00:44:00 Class 11: Generic Rigidity 00:50:00 Class 12: Tensegrities 00:18:00 Class 13: Locked Linkages 00:52:00 Class 14: Hinged Dissections 00:53:00 Class 15: General & Edge Unfolding 00:51:00 Class 16: Vertex & Orthogonal Unfolding 00:41:00 Class 17: D-Forms 00:44:00 Class 19: Refolding & Kinetic Sculpture 00:31:00 Class 20: 3D Linkage Folding 00:39:00 Assessment Submit Your Assignment 00:00:00 Certification 00:00:00

## 4.9

4.9
8 ratings
• 5 stars0
• 4 stars0
• 3 stars0
• 2 stars0
• 1 stars0

No Reviews found for this course.

5 STUDENTS ENROLLED