Face force – a multidimensional generalization of mesh currents

Slides:



Advertisements
Similar presentations
Social Network Analysis (in 10 minutes) Nick Crossley.
Advertisements

A relation between Structures and Network Flows Through Graph Representation It was found that the same type of representation, a Graph, can be associated.
Convex drawing chapter 5 Ingeborg Groeneweg. Summery What is convex drawing What is convex drawing Some definitions Some definitions Testing convexity.
Greedy Algorithms Spanning Trees Chapter 16, 23. What makes a greedy algorithm? Feasible –Has to satisfy the problem’s constraints Locally Optimal –The.
New entity in statics – “Face Force” Developing new engineering concept through graph representations.
Combinatorial Representations for Analysis and Conceptual Design in Engineering Dr. Offer Shai Department of Mechanics, Materials and Systems Faculty of.
The Equivalence between Static (rigid) and Kinematic (flexible, mobile) Systems through the Graph Theoretic Duality Dr. Offer Shai Tel-Aviv University.
Revealing Order in Complex Systems through Graph Representations Dr. Offer Shai Department of Mechanics, Materials and Systems Faculty of Engineering Tel-Aviv.
The Duality between Planar Kinematics and Statics Dr. Shai, Tel-Aviv, Israel Prof. Pennock, Purdue University.
Dilations.
Rigidity of 2d and 3d Pinned Frameworks and pebble game". Dr. Offer Shai Department of Mechanics Materials and Systems, Tel Aviv University, Israel
General view on the duality between statics and kinematics M.Sc student: Portnoy Svetlana Advisor: Dr. Offer Shai.
© 2010 Pearson Education, Inc. All rights reserved Constructions, Congruence, and Similarity Chapter 12.
Pebble games for rigidity Overview. The game of pebbling was first suggested by Lagarias and Saks, as a tool for solving a particular problem in number.
P. Nikravesh, AME, U of A Fundamentals of Analytical Analysis 2Introduction Fundamentals of An Analytical Method The vector-loop method is a classical.
Transforming Knowledge to Structures from Other Engineering Fields by Means of Graph Representations. Dr. Offer Shai and Daniel Rubin Department of Mechanics,
Plane Motion of Rigid Bodies: Forces and Accelerations
Proceedings of the ASME 2010 International Design Engineering Technical Conferences &Computers and Information in Engineering Conference IDETC/CIE 2010.
1 Adding charts anywhere Assume a cow is a sphere Cindy Grimm and John Hughes, “Parameterizing n-holed tori”, Mathematics of Surfaces X, 2003 Cindy Grimm,
G1G1 gigi G2G2 gjgj D Duality between Engineering Systems Since graph representations are mathematical entities, mathematical relations can be established.
Solid Geometry - Objectives Classify three-dimensional figures according to their properties. Use nets and cross sections to analyze three-dimensional.
Adnan Sljoka KGU/CREST, Japan How to inductively construct floating body-hinge / molecular Assur graphs?
Stable, Circulation- Preserving, Simplicial Fluids Sharif Elcott, Yiying Tong, Eva Kanso, Peter Schröder, and Mathieu Desbrun.
A model of Caterpillar Locomotion Based on Assur Tensegrity Structures Shai Offer School of Mechanical Engineering, Faculty of Engineering, Tel-Aviv University,
The countable character of uncountable graphs François Laviolette Barbados 2003.
Area Measurements.
Area Measurements.
Role of Rigid Components in Protein Structure Pramod Abraham Kurian.
The correction to Grubler’s criterion for calculating the Degrees of Freedom of Mechanisms Proceedings of the ASME 2011 International Design Engineering.
Geometric Constructions with Understanding **This is meant as a resource to the teacher! It is NOT intended to replace teaching in the classroom OR the.
Chapter Relations and Their Properties
SINGULARITY in Mobile Symmetric Frameworks Offer Shai - The main definition of Assur Graphs. - The singularity of Assur Graphs. - Deriving the symmetric.
February 17, 2005Lecture 6: Point Location Point Location (most slides by Sergi Elizalde and David Pritchard)
Topics in Rigidity Theory from the Aspect of Assur Graphs Offer Shai - Rigid structures are compositions of cycles of atoms (Assur Graphs) - The main.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Spanning Tree Definition:A tree T is a spanning tree of a graph G if T is a subgraph of G that contains all of the vertices of G. A graph may have more.
CSC 252: Algorithms October 28, 2000 Homework #5: Graphs Victoria Manfredi (252a-ad) notes: -Definitions for each of the graph concepts are those presented.
Computational Algorithm for Determining the Generic Mobility of Floating Planar and Spherical Linkages Offer Shai Mechanical Engineering School, Tel-Aviv.
Exploring Structural Engineering Fundamentals.
Proceedings of the ASME 2012 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference IDETC/CIE 2012.
Platonic Solids And Zome System.
CHECKING MOBILITY AND DECOMPOSITION OF LINKAGES
Hans Bodlaender, Marek Cygan and Stefan Kratsch
The countable character of uncountable graphs François Laviolette Barbados 2003.
NP-Completeness (2) NP-Completeness Graphs 7/23/ :02 PM x x x x
A Unified Concept for the Graph Representation of
Sketching the Derivative
Non-manifold Multiresolution Modeling (some preliminary results)
Properties of Parallelograms
Lecture 10 CSE 331 Sep 21, 2016.
Lecture 10 CSE 331 Sep 20, 2017.
Properties of Parallelograms
Dependency Models – abstraction of Probability distributions
Chapter 9: Graphs Basic Concepts
Duality between Engineering Systems
properties(gk)=T(laws(sj))
Properties of Parallelograms
12 Chapter Congruence, and Similarity with Constructions
Tohoku University.
Spin Models and Distance-Regular Graphs
Geometric Reasoning About Mechanical Assembly
12 Chapter Congruence, and Similarity with Constructions
Warm Up – 3/14 - Friday 100 seats are to be apportioned.
Analysis of engineering system by means of graph representation
The Complexity of Approximation
Chapter 9: Graphs Basic Concepts
GRAPHS.
properties(gk)=T(laws(sj))
Presentation transcript:

Face force – a multidimensional generalization of mesh currents

It was proved that face forces manifest some properties of electric potentials.

A New View on Engineering Systems through the Engineering Knowledge Genome: Structural Genes of Systems Topologies

General View on Systems Topologies Over Constrained Systems Under Constrained Systems Well constrained Systems Compositions of s-genes Gene 1 Gene 2 Gene 3

Definition of s-genes G is an s-gene IFF it is a well constrained graph and removing any set of vertices does not result in an s-gene. Examples s-genes in the following disciplines: Trusses Linkages Sketches These entities are genes because they are the building blocks of these and many other systems in different disciplines

Definition of s-genes in trusses A truss is an –gene IFF it is rigid determinate truss but does not contain any substructure that is a determinate truss A B D C P1 P2 P3 1 3 4 5 6 7 8 2 A B D P1 P2 P3 3 4 6 7 8 A B D C P1 P2 P3 1 3 4 5 6 8 2 s-gene mechanism mechanism

Removing vertex C result in Example of a system that is not an s-gene: A B D C P1 P2 P3 A B D P1 P2 P3 C Removing vertex C result in an s-gene Sub system that is an s-gene The first was not an s-gene

S-genes in well-constrained sketches B 1 2 3  L1 C A B C L1 1 3 2  L3 The sketch (geometric constraint) problem. The corresponding graph is a floating s-gene. L3 A B 1 2 3  L1 C The s-gene after grounding edge (2,C).

The process of constructing all the s-gene (in 2D, for now). (The process is complete and sound)

Ground edge is replaced by a triangle and two new ground edges. Basic s-gene – the dyad. A A1 A2 Ground edge is replaced by a triangle and two new ground edges. Fundamental Extension x y z t Dividing edge (x,y) to two by adding an inner vertex z and connecting z to an arbitrary vertex z, can be the ground. Regular extension

Example of creation s-genes B C E D O1 O2 O3 O4 F O5 (a) (b) (c) (b1) (b2) (c1) (c2) (A,O2) (B,O3) (A,B) (A,D) (A,E) The dyad.

The Map of all the genes in 2D

The Decomposition of Well-Constrained Systems into S-Genes B C D A A,B,C,D G E F E,F,G I H J O3 H,I,J K K O1 O2 The Decomposition Graph (obtained computationally by pebble game) Well Constrained Truss

Employing the Decomposition into S-Genes for Analysis 2* number of inner vertices = number of edges in the s-gene. I E F G H J K O3 O1 O2 1 2 3 4 7 5 6 8 2*4=8 J I K A B E C O1 O3 D F G H O2 The Determinate Truss I P6 H J K O3 O1 O2 PG P3 1 2 3 4 5 6 P8 P1 2*3=6 J K O3 O1 O2 1 2 3 4 5 6 2*3=6 P1 P6 P5 1 2 P6 2*1=2

Employing the s-genes for constructing well constrained sketches B 1 2 3  L1 C A B C L1 1 3 2  L3 The sketch problem The corresponding floating s-gene L3 A B 1 2 3  L1 C Grounding edge (2,C) L3 A B 1 2 3  L1 C Grounding edge (A,3) A,1,3,B 1 B C 2 The composition graph The composition graph

The process of constructing the geometric object by composing its s-genes 1 A 3 (b) (A,3)  L3 A B 1 2 3  L1 C A 3 (a) (A,3) A B 3 L3  C L1 1 (d) (A,3) 1 A (A,3) B 3 L3  (c) A B 3 L3  C L1 1 2 (e) 1 (A,3) B C 2

S-genes in mechanisms Strangely! S-genes in mechanisms are exactly the same as s-genes in trusses with the addition of a driving link

Deriving mechanisms’ S-genes from trusses’ s-genes B D C P1 P2 P3 1 3 4 5 6 7 8 2 (a) A Truss s-gene A B D C P1 P2 1 3 4 5 6 7 8 2 A B D C P2 P3 1 3 4 5 6 7 8 2 A B D C P1 P3 1 3 4 5 6 7 8 2 P3 P1 P2

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

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

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

Employing s-genes for synthesis