Menu
|
111-222-292 (Ext: 245)
Home
|
About US
|
Creditors
|
Mentorship
|
Faq
Home
About US
Creditors
Mentorship
Faq
Lecture
SEARCH COURSES / LECTURES
Search Lectures
Search Courses
All Disciplines
Basic and Health Sciences
Biology
Chemistry
Mathematics
Physics
Medicine
Test Prep
Applied Sciences
Agricultural Science
Computer Science
Earth, Atmospheric, and Planetary Sciences
Energy
Engineering
Healthcare
Social Sciences
Business and Finance
Economics
English
History
Arts and Humanities
Law
Literature and Linguistics
Management
Marketing
Mass Communication
Philosophy
Physical Education
Political Science
Psychology
Sociology
All Levels
Undergraduate
School
College
Graduate
All Institutes
Harvard
Khan Academy
Khan Academy Urdu
MIT
Oxford
Stanford
UCI Open
Udacity
Virtual Education Project Pakistan (VEPP)
Virtual University
Yale University
Home
>>
Engineering
>>
Electrical Engineering and Computer Science (M-I-T)
>>
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
(40 Lectures Available)
S#
Lecture
Course
Institute
Instructor
Discipline
1
Class 10: Kempe's Universality Theorem (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
2
Class 11: Generic Rigidity (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
3
Class 12: Tensegrities (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
4
Class 13: Locked Linkages (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
5
Class 14: Hinged Dissections (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
6
Class 15: General & Edge Unfolding (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
7
Class 16: Vertex & Orthogonal Unfolding (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
8
Class 17: D-Forms (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
9
Class 19: Refolding & Kinetic Sculpture (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
10
Class 1: Overview (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
11
Class 20: 3D Linkage Folding (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
12
Class 2: Universality & Simple Folds (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
13
Class 3: Single-Vertex Crease Patterns (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
14
Class 4: Efficient Origami Design (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
15
Class 5: Tessellations & Modulars (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
16
Class 6: Architectural Origami (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
17
Class 7: Origami is Hard (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
18
Class 8: Fold & One Cut (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
19
Class 9: Pleat Folding (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
20
Lecture 10: Kempe's Universality Theorem (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
21
Lecture 11: Rigidity Theory (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
22
Lecture 12: Tensegrities & Carpenter's Rules (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
23
Lecture 13: Locked Linkages (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
24
Lecture 14: Hinged Dissections (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
25
Lecture 15: General & Edge Unfolding (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
‹
1
2
›
Basic and Health Sciences
Biology
Chemistry
Mathematics
Physics
Medicine
Test Prep
Applied Sciences
Agricultural Science
Computer Science
Earth, Atmospheric, and Planetary Sciences
Energy
Engineering
Healthcare
Social Sciences
Business and Finance
Economics
English
History
Arts and Humanities
Law
Literature and Linguistics
Management
Marketing
Mass Communication
Philosophy
Physical Education
Political Science
Psychology
Sociology