Minghsin University of Science and Technology
Uedu Main Site
Explore Uedu
Student Console
Register as Member/Login
Research Informed Consent Center
Survey Center
Teacher Console
Course Setup
Support & Messages
Uptime Data

UeduGPTs

--

Jupyters

20

Local AI

--

Uedu Code

--

CISOSE26 Local AI Uedu Code UG26
明新科大 AQI 48 26°C PM2.5 6
AI Reply Desktop Notifications

Show a desktop notification when the AI TA finishes replying

Chat Message Notifications

Notify me when classmates post messages in the forum

Sound notification

Play an alert sound whenever there is a new notification

Uedu Open / Geometric Folding Algorithms: Linkages, Origami, Polyhedra
6.849

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Prof. Erik Demaine | Fall 2012
Art, Design & Architecture Visual Arts Data Science, Analytics & Computer Technology Algorithms and Data Structures Computer Science Science & Math Mathematics Engineering
Go to original course
CC BY-NC-SA 4.0
Course introduction

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.

Acknowledgments

Thanks to videographers Martin Demaine and Jayson Lynch.

Course Information
SourceMIT 開放式課程
DepartmentElectrical Engineering and Computer Science
LanguageEnglish
Number of videos0
Course videos (0)
No video materials are available for this Course yet
Go to the original course page to view