1 / 26

Rigidity of 2d and 3d Pinned Frameworks and pebble game".

Rigidity of 2d and 3d Pinned Frameworks and pebble game". Dr. Offer Shai Department of Mechanics Materials and Systems, Tel Aviv University, Israel shai@eng.tau.ac.il. Pebble game. Rigidity Theory. Mechanical Engineering. Theorems and methods in Engineering. In this talk:

tasya
Download Presentation

Rigidity of 2d and 3d Pinned Frameworks and pebble game".

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Rigidity of 2d and 3d Pinned Frameworks and pebble game". Dr. Offer Shai Department of Mechanics Materials and Systems, Tel Aviv University, Israel shai@eng.tau.ac.il

  2. Pebble game Rigidity Theory Mechanical Engineering Theorems and methods in Engineering In this talk: Theorems in engineering underlying rigidity circuits. Methods for check rigidity of Pinned Frameworks from engineering.

  3. Pebble Game and Pinned Frameworks • Pebble game results in 1. Pinned Framework (the pinned edges correspond to the free pebbles at the end). 2. Separation of the Pinned Framework into special type of Pinned Framework, referred as Assur Graphs.

  4. A B 6 A 4 5 3 4 B C 1 3 2 1 2 ( a ) ( b ) Assur Graphs (AGs) Definitions (many): 1. Structure with zero mobility that does not contain a simpler substructure of the same mobility. 2. Minimal rigid related to vertices. 3. Cycles of dyads. and more (Servatius et al., 2010). Not Assur Graph Assur Graph

  5. Pebble game results in Partition into Assur Graphs. Each directed Cutset defines a partition.The cyclic (well concected) subgraph are Assur Graphs. First Triad Application of the pebble game Decomposition into two triads. Second Triad 2 1

  6. The same applies in 3d Application of the pebble game Decomposition into two triads. 3 2 1

  7. Necessary Condition for Pinned Isostatic Frameworks in d dimension: • Decomposed into AGs. • There should be at least d+1 ground edges. • Each AG should be connected to the others by at least d ground vertices.

  8. ExampleNot rigid because:1. Can not be decomposed into AGs.2. There are d ground (pinned) edges instead of d+1.

  9. Example. Pebble Game reveals the Connection Problem between AGs in 2D. AG I AG I AG II AG II Rigid Not Rigid – AG I is connected through d-1 vertices.

  10. Example. In 3D Pebble Game does not reveal the Connection Problem between the AGs. Implied Hinge Application of the pebble game Decomposition into two 3D triads. 3 2 1

  11. A 2 A B 1 3 G C D O G F E D A F E B C O G G D F E D,E,F G Application of the pebble game A Decomposition.

  12. Implied Hinges = Implied Hinges + Implied Hinges in the connections in AGs easy ?????????? The problem of Implied Hinges If there is a circuit of size three, we locate the 6 free pebbles on its vertices. A

  13. Relation between Assur Graphs and rigidity circuits.Contract the ground vertices into d-1 support vertices and add a d-2 simplex. contract all the ground vertices into one vertex. (Servatius et al., 2010) 2D Rigid in 2D 2D Triad In 3D – Contract the ground vertices into two support vertices and add an edge between the two support vertices. 3D Rigid in 3D 3D Triad Adding an edge between the two support vertices – rigidity circuit

  14. A B A A B B A B H H H H C D C D C D C D F F F E E E F E G G G G (d) (c) (b) (a) E,F,G E,F,G A,B,C,D,E,F,G,H A,B,C,D,E,F,G,H H H A,B,C,D A,B,C,D (d1) (c1) (b1) (a1) Engineering theorems underlying Rigidity Circuits Suppose you have a Pinned Framework and an external force applied on one of the vertices. When will there be forces on all the edges? Theorem: there will be forces on all the edges IFF the vertex ,where the external force acts, belongs to the first AG in the decomposition order and there is a directed path from this AG to any AGs in the decomposition graph

  15. The topology structure of rigidity circuits (in 2d, 3d and possibley in higher dimensions): The scheme of rigidity circuits as a composition of Assur Graphs and an additional edge.

  16. The Map of all AGs in 2D

  17. v u w w u Dyad in dimension d The Map of 3d AGs - The map is NOT complete. - We try to “rephrase” the extension operation. - Extension in dimension d is – adding a ‘d’ dyad.

  18. The Origin of Assur Graphs (Groups) Assur Graphs (Groups) were developed in Russia, in 1914, for decomposing linkages (mechanisms) into primitive building blocks – for analysis, optimization and more.

  19. A C 3 B B 4 C 3 1 2 A 5 E 2 J 10 4 D F 6 G D J 5 9 7 8 10 6 E H F G 9 H 7 I 8 11 I 11 A mechanism A schematic graph of the mechanism

  20. B C 3 A 2 4 D J 5 6 E G H 7 8 I 11 The decomposition of the schematic graph into s-genes 10 F 9 Tetrad Diad Triad

  21. B C 3 A 2 4 D J 5 E 6 E G H 7 8 I 11 10 F 9 Decomposition of the mechanism Tetrad Diad Triad Velocities of inner joints are known A C 3 B 4 1 2 5 E J 10 D F 6 G 9 7 8 H I 11

  22. Nowadays, we use Assur Graphs for synthesis of linkages, structures and more.

  23. Thank you!!

More Related