Home
學生控制台
註冊會員/登入
研究知情同意書
UeduGPTs
Aida 優學伴
Uedu Open
支援與訊息

UeduGPTs

--

Jupyters

2

AI 回覆桌面通知

AI 助教回覆完成時顯示桌面通知

聊天訊息通知

同學在討論區發送訊息時通知

聲音通知

每當有新通知時播放提示音

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
前往原始課程
CC BY-NC-SA 4.0
課程簡介

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.

課程資訊
來源MIT 開放式課程
科系Electrical Engineering and Computer Science
語言English
影片數0
課程影片 (0)
此課程尚無影片資料
前往原始課程頁面查看