Geometry of Flat Origami Triangulations 4 3 4 3 4 3 4 3 6 - PowerPoint PPT Presentation

Geometry of Flat Origami Triangulations 4 3 4 3 4 3 4 3 6 6 6 6 5 5 5 5 1 2 1 2 1 2 1 2 �� 4 3 4 3 4 3 4 3 6 6 6 6 5 5 5 5 1 2 1 2 1 2 1 2 Bryan Gin-ge Chen & Chris Santangelo UMass Amherst Physics

Origami in nature and engineering Saito et al, PNAS 2017 Andresen et al, PRE 2007 J.-H. Na et al., Adv. Mat. 2015 Wood et al, Science 2015

Robert Lang Daniel Piker, after Ron Resch, Ben Parker and John Mckeeve http://spacesymmetrystructure.wordpress.com/2009/03/24/origami-electromagnetism/

But how much does a crease pattern really tell us? Robert Lang Daniel Piker, after Ron Resch, Ben Parker and John Mckeeve http://spacesymmetrystructure.wordpress.com/2009/03/24/origami-electromagnetism/

But how much does a crease pattern really tell us? What does it tell us near the flat state? Robert Lang Daniel Piker, after Ron Resch, Ben Parker and John Mckeeve http://spacesymmetrystructure.wordpress.com/2009/03/24/origami-electromagnetism/

Rigid origami as bond-node structure Triangulated V b -gon : V b boundary vertices

Rigid origami as bond-node structure “bird base” Triangulated V b -gon : V b boundary vertices

Rigid origami as bond-node structure “bird base” Demaine et al, Graphs and Combinatorics, 2011 Triangulated V b -gon : V b boundary vertices

Rigid origami as bond-node structure “bird base” Demaine et al, Graphs and Combinatorics, 2011 V int : # of internal vertices Triangulated V b -gon : V b boundary vertices

Rigid origami as bond-node structure “bird base” Demaine et al, Graphs and Combinatorics, 2011 V int : # of internal vertices Triangulated V b -gon : V b boundary vertices 3V int +V b -3: # of folds

Rigid origami as bond-node structure “bird base” Demaine et al, Graphs and Combinatorics, 2011 V int : # of internal vertices Triangulated V b -gon : V b boundary vertices 3V int +V b -3: # of folds # of degrees of freedom?

Rigid origami as bond-node structure “bird base” Demaine et al, Graphs and Combinatorics, 2011 V int : # of internal vertices Triangulated V b -gon : V b boundary vertices 3V int +V b -3: # of folds # of degrees of freedom? N 0 = 3( V int + V b ) − (3 V int + V b − 3 + V b )

Rigid origami as bond-node structure “bird base” Demaine et al, Graphs and Combinatorics, 2011 V int : # of internal vertices Triangulated V b -gon : V b boundary vertices 3V int +V b -3: # of folds # of degrees of freedom? N 0 = 3( V int + V b ) − (3 V int + V b − 3 + V b ) = V b + 3 =6 + ( V b − 3)

Rigid origami as bond-node structure “bird base” Demaine et al, Graphs and Combinatorics, 2011 V int : # of internal vertices Triangulated V b -gon : V b boundary vertices 3V int +V b -3: # of folds # of degrees of freedom? N 0 = 3( V int + V b ) − (3 V int + V b − 3 + V b ) = V b + 3 =6 + ( V b − 3) rigid body motions

Rigid origami as bond-node structure “bird base” Demaine et al, Graphs and Combinatorics, 2011 V int : # of internal vertices Triangulated V b -gon : V b boundary vertices 3V int +V b -3: # of folds # of degrees of freedom? N 0 = 3( V int + V b ) − (3 V int + V b − 3 + V b ) = V b + 3 =6 + ( V b − 3) generically V b -3 dof rigid body motions

Configuration space near the flat state 4 3 4 3 6 6 5 5 1 2 1 2 BGC and Santangelo, 2017

Configuration space near the flat state 4 3 4 3 4 branches 6 6 5 5 1 2 1 2 BGC and Santangelo, 2017

BGC and Santangelo, 2017

Flat is not generic!

Flat is not generic! V int +1 linear motions!

Flat is not generic! V int +1 linear motions! vs generically 1dof ??

Flat is not generic! V int +1 linear motions! vs generically 1dof ?? Toy example:

Flat is not generic! V int +1 linear motions! vs generically 1dof ?? linear motion Toy example:

Flat is not generic! V int +1 linear motions! vs generically 1dof ?? linear motion Toy example: redundant constraints = ‘self stress’

Flat is not generic! V int +1 linear motions! vs generically 1dof ?? linear motion compression Toy example: tension redundant constraints = ‘self stress’

Self stresses and second-order constraints linear motion compression tension

Self stresses and second-order constraints linear motion compression tension The second-order constraints are in 1 to 1 correspondence with self stresses! Connelly and Whiteley, SIAM J Discrete Math 1996

Self stresses and second-order constraints linear motion compression tension The second-order constraints are in 1 to 1 correspondence with self stresses! u T Ω u = 0 symmetric Ω “stress matrix” Connelly and Whiteley, SIAM J Discrete Math 1996

Self stresses and second-order constraints linear motion u Ω compression tension The second-order constraints are in 1 to 1 correspondence with self stresses! u T Ω u = 0 symmetric Ω “stress matrix” Connelly and Whiteley, SIAM J Discrete Math 1996

Self stresses in flat triangulations BGC and Santangelo, 2017

Self stresses in flat triangulations “wheel stress” BGC and Santangelo, 2017

Self stresses in flat triangulations vertical “wheel stress” u displacements BGC and Santangelo, 2017

Self stresses in flat triangulations vertical “wheel stress” u displacements u T Ω u = 0 symmetric Ω stress matrix BGC and Santangelo, 2017

Self stresses in flat triangulations vertical “wheel stress” u displacements β 4 , 1 β 2 , 3 β 1 , 2 u T Ω u = 0 ψ 1 ψ 3 ψ 2 Gaussian curvature ψ 4 vanishes at each vertex symmetric α 4 , 1 α 2 , 3 Ω α 1 , 2 stress matrix BGC and Santangelo, 2017

Self stresses in flat triangulations vertical “wheel stress” u displacements β 4 , 1 β 2 , 3 β 1 , 2 u T Ω u = 0 ψ 1 ψ 3 ψ 2 Gaussian curvature ψ 4 ⇐ ⇒ vanishes at each vertex symmetric α 4 , 1 α 2 , 3 Ω !! α 1 , 2 stress matrix BGC and Santangelo, 2017

origami n-vertex configuration space u T Ω u = 0 4 3 (n+1)-vector of vertical u 5 displacements 1 2 (n+1)x(n+1) Ω symmetric stress matrix 6 3-dim kernel from isometries BGC and Santangelo, 2017

origami n-vertex configuration space u T Ω u = 0 4 3 (n+1)-vector of vertical u 5 displacements 1 2 (n+1)x(n+1) Ω symmetric stress matrix 6 3-dim kernel from isometries Always exactly one negative eigenvalue! Kapovich and Millson, Publ. RIMS Kyoto Univ, 1997 BGC and Santangelo, 2017

origami n-vertex configuration space u T Ω u = 0 4 3 (n+1)-vector of vertical u 5 displacements 1 2 (n+1)x(n+1) Ω symmetric stress matrix 6 3-dim kernel from isometries Always exactly one negative eigenvalue! Kapovich and Millson, Publ. RIMS Kyoto Univ, 1997 BGC, Theran and Nixon, 2017 BGC and Santangelo, 2017

What are the two nappes? 4 3 5 1 2 6 BGC and Santangelo, 2017

What are the two nappes? 4 3 5 1 2 6 BGC and Santangelo, 2017 Demaine et al, Proceedings of the IASS, 2016

What are the two nappes? 4 3 Negative eigenvector 5 maximizes 1 2 Gaussian curvature 6 BGC and Santangelo, 2017 Demaine et al, Proceedings of the IASS, 2016

What are the two nappes? 4 3 5 1 2 6 BGC and Santangelo, 2017 Demaine et al, Proceedings of the IASS, 2016

What are the two nappes? + 4 3 5 1 2 – 6 BGC and Santangelo, 2017 Demaine et al, Proceedings of the IASS, 2016

What are the two nappes? + 4 3 + 5 1 2 – – 6 The two nappes correspond to popped up and popped down configurations! BGC and Santangelo, 2017 Demaine et al, Proceedings of the IASS, 2016 Abel et al, JoCG, 2016; Streinu and Whiteley, 2005

Multiple vertex configuration space 4 3 4 3 6 6 5 5 1 2 1 2 BGC and Santangelo, 2017

Geometry of Flat Origami Triangulations 4 3 4 3 4 3 4 3 6 - PowerPoint PPT Presentation

Geometry of Flat Origami Triangulations 4 3 4 3 4 3 4 3 6 6 6 6 5 5 5 5 1 2 1 2 1 2 1 2 4 3 4 3 4 3 4 3 6 6 6 6 5 5 5 5 1 2 1 2 1 2 1 2 Bryan Gin-ge Chen & Chris

Triangulations Of Polytopes and Algebraic Geometry Francisco Santos Universidad de Cantabria,

Computational Geometry Lecture 12: Delaunay Triangulations Computational Geometry Lecture 12:

Random Triangulations and Emergent Conformal Structure Discrete Differential Geometry, Berlin,

1 n log n ) An O( n n 3 O( n log n 3 ) An An O( )- -Time Triangulation Algorithm Time

Geography on Boost.Geometry The Earth is not flat (but its not round either) Vissarion

Computational Geometry Triangulations and Guarding Art Galleries Michael T. Goodrich with

Computational Geometry Lecture 12: Delaunay Triangulations 1 Computational Geometry Lecture 12:

Computational Geometry Lecture 12: Delaunay Triangulations Computational Geometry Lecture 12:

Delaunay Triangulations Carola Wenk Based on: Computational Geometry: Algorithms and

Counting Polygon Triangulations is Hard David Eppstein University of California, Irvine

Building Good Triangulations 1. Nets and thick triangulations 2. Triangulation of manifolds

Triangulations, Planar Subdivisions and Point Location Carola Wenk Based on: Computational

Complete flat Lorentzian three-manifolds Introduction Proper group actions AdS geometry:

Flat geometry on Riemann surfaces and Teichm uller dynamics in moduli spaces Anton Zorich

Triangulations and Guarding Art Galleries Carola Wenk 1/29/15 1 CMPS 3130/6130 Computational

Attaching Fluorescent Nanoclusters to DNA Origami Microarrays John Devany 10/31/14 Worster

Chemical Durability of Vitreous Wasteforms Stphane GIN, CEA, Marcoule site, France Waste

A PYTHONIC FULL-TEXT SEARCH PAOLO MELCHIORRE ~ @pauloxnet Paolo Melchiorre CTO @ 20tab

Colton Shepard PostgresOpen 2019 What is all this, anyways? JavaScript Object Notation Data

http://cs224w.stanford.edu Output: Node embeddings. We can also embed larger network

Generic deformations of matroid ideals Alexandru Constantinescu (joint work with Thomas Kahle and

JUST THE MATHS SLIDES NUMBER 5.9 GEOMETRY 9 (Curve sketching in general) by A.J.Hobson

A Graphical Framework for the Analysis of Mixed Multi-Unit Combinatorial Auctions M. Vinyals 1 A.

A model of several point-like windows in the resonator boundary with the Dirichlet boundary