| S# |
Lecture |
Course |
Institute |
Instructor |
Discipline |
| 3651 |
Lec 7 | MIT RES.6-008 Digital Signal Processing, 1975 (M-I-T)
|
Digital Signal Processing (M-I-T)
|
MIT
|
Prof. Alan V. Oppenheim
|
Applied Sciences
|
| 3652 |
Class 8: Fold & One Cut (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3653 |
Lec 8 | MIT RES.6-008 Digital Signal Processing, 1975 (M-I-T)
|
Digital Signal Processing (M-I-T)
|
MIT
|
Prof. Alan V. Oppenheim
|
Applied Sciences
|
| 3654 |
Class 9: Pleat Folding (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3655 |
Lec 9 | MIT RES.6-008 Digital Signal Processing, 1975 (M-I-T)
|
Digital Signal Processing (M-I-T)
|
MIT
|
Prof. Alan V. Oppenheim
|
Applied Sciences
|
| 3656 |
Lecture 10: Kempe's Universality Theorem (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3657 |
Lecture 11: Rigidity Theory (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3658 |
Lecture 12: Tensegrities & Carpenter's Rules (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3659 |
Lecture 13: Locked Linkages (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3660 |
Lecture 14: Hinged Dissections (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3661 |
Lecture 15: General & Edge Unfolding (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3662 |
Lecture 16: Vertex & Orthogonal Unfolding (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3663 |
Lecture 17: Alexandrov's Theorem (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3664 |
Lecture 18: Gluing Algorithms (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3665 |
Lecture 19: Refolding & Smooth Folding (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3666 |
Lecture 1: Overview (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3667 |
Lecture 20: Protein Chains (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3668 |
Lecture 21: HP Model & Interlocked Chains (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3669 |
Lecture 2: Simple Folds (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3670 |
Lecture 3: Single-Vertex Crease Patterns (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3671 |
Lecture 4: Efficient Origami Design (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3672 |
Lecture 5: Artistic Origami Design (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3673 |
Lecture 6: Architectural Origami (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3674 |
Lecture 7: Origami is Hard (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3675 |
Lecture 8: Fold & One Cut (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
