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
Applied Sciences
Social Sciences
All Levels
Undergraduate
School
College
Graduate
All Institutes
am
Khan Academy Urdu
Virtual Education Project Pakistan (VEPP)
Harvard
UCI Open
MIT
Oxford
Yale University
Khan Academy
Udacity
Stanford
Virtual 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
26
Lecture 16: Vertex & Orthogonal Unfolding (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
27
Lecture 17: Alexandrov's Theorem (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
28
Lecture 18: Gluing Algorithms (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
29
Lecture 19: Refolding & Smooth Folding (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
30
Lecture 1: Overview (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
31
Lecture 20: Protein Chains (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
32
Lecture 21: HP Model & Interlocked Chains (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
33
Lecture 2: Simple Folds (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
34
Lecture 3: Single-Vertex Crease Patterns (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
35
Lecture 4: Efficient Origami Design (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
36
Lecture 5: Artistic Origami Design (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
37
Lecture 6: Architectural Origami (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
38
Lecture 7: Origami is Hard (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
39
Lecture 8: Fold & One Cut (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
MIT
Prof. Erik Demaine
Applied Sciences
40
Lecture 9: Pleat Folding (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