Paper folding | Polyhedra | Computational geometry
Geometric Folding Algorithms: Linkages, Origami, Polyhedra is a monograph on the mathematics and computational geometry of mechanical linkages, paper folding, and polyhedral nets, by Erik Demaine and Joseph O'Rourke. It was published in 2007 by Cambridge University Press (ISBN 978-0-521-85757-4).A Japanese-language translation by Ryuhei Uehara was published in 2009 by the Modern Science Company (ISBN 978-4-7649-0377-7). (Wikipedia).
Geometric Algebra - The Matrix Representation of a Linear Transformation
In this video, we will show how matrices as computational tools may conveniently represent the action of a linear transformation upon a given basis. We will prove that conventional matrix operations, particularly matrix multiplication, conform to the composition of linear transformations.
From playlist Geometric Algebra
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This class begins with a folding exercise of numerical digits. Questions discussed cover strip folding in the context of efficienc
From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This lecture presents the fold and cut problem, and both the straight skeleton method and disk-packing method. Simple fold and cut
From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012
Geometric Algebra - Linear Transformations, Outermorphism, and the Determinant
In this video, we will review some basic concepts from linear algebra, such as the linear transformation, prove important theorems which ground matrix operations, extend the linear transformation on vectors to higher-graded elements to bivectors and trivectors, and define the determinant o
From playlist Geometric Algebra
Lecture 19: Refolding & Smooth Folding
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This lecture begins with a problem involving unfolding and refolding. Examples of smooth foldings and unfoldings are given, follow
From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012
We discuss how "geometric transformations" (rotations, stretching, reflection) can be represented by matrices. We also briefly introduce the idea of "point matrices" and their application in computer graphics.
From playlist Mathematical Physics I Uploads
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This lecture begins with how to construct a gluing tree. Combinatorial bounds and algorithms are proved for gluing results, which
From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This class begins with a demonstration of software for fold and cut. Odd-degree vertices, and a comparison of skeleton method and
From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This lecture introduces the topics covered in the course and its motivation. Examples of applications are provided, types and char
From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012
MIT 6.006 Introduction to Algorithms, Spring 2020 Instructor: Erik Demaine, Jason Ku, Justin Solomon View the complete course: https://ocw.mit.edu/6-006S20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY In this lecture, Erik Demaine, Jason Ku, a
From playlist MIT 6.006 Introduction to Algorithms, Spring 2020
Lecture 24: Topics in Algorithms Research
MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Erik Demaine, Srini Devadas License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
From playlist MIT 6.006 Introduction to Algorithms, Fall 2011
AMMI Course "Geometric Deep Learning" - Lecture 12 (Applications & Conclusions) - Michael Bronstein
Video recording of the course "Geometric Deep Learning" taught in the African Master in Machine Intelligence in July-August 2021 by Michael Bronstein (Imperial College/Twitter), Joan Bruna (NYU), Taco Cohen (Qualcomm), and Petar Veličković (DeepMind) Lecture 12: What's next? • Beyond Mess
From playlist AMMI Geometric Deep Learning Course - First Edition (2021)
Cell Learning Theory - Seminar 2 - On AlphaFold
This seminar series is about computation and learning in cell. In this seminar David Li talks about AlphaFold, a neural network engineered by DeepMind to predict folding of proteins. The webpage for this seminar is https://metauni.org/posts/events/seminar-clt. You can join this seminar
From playlist Metauni
This is Lecture 20 of the CSE549 (Computational Biology) course taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 2010. The lecture slides are available at: http://www.algorithm.cs.sunysb.edu/computationalbiology/pdf/lecture20.pdf More inf
From playlist CSE549 - Computational Biology - 2010 SBU
Lecture 4: Efficient Origami Design
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This lecture continues to discuss the tree method and characterizing a uniaxial base. Another algorithm, Origamizer, is presented
From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This lecture focuses on the folding of the backbone chain of proteins in relation to fixed-angle linkages. Four problems types (sp
From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012
AMMI 2022 Course "Geometric Deep Learning" - Lecture 12 (Applications & Trends) - Michael Bronstein
Video recording of the course "Geometric Deep Learning" taught in the African Master in Machine Intelligence in July 2022 by Michael Bronstein (Oxford), Joan Bruna (NYU), Taco Cohen (Qualcomm), and Petar Veličković (DeepMind) Lecture 12: What's next? • Beyond traditional Message Passing •
From playlist AMMI Geometric Deep Learning Course - Second Edition (2022)
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This lecture introduces the hyperboloic paraboloid, hyparhedra, and the circular pleat. Topics include triangulated folding of the
From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012