2014
DOI: 10.3390/sym6030516
|View full text |Cite
|
Sign up to set email alerts
|

Symmetry Adapted Assur Decompositions

Abstract: Assur graphs are a tool originally developed by mechanical engineers to decompose mechanisms for simpler analysis and synthesis. Recent work has connected these graphs to strongly directed graphs and decompositions of the pinned rigidity matrix. Many mechanisms have initial configurations, which are symmetric, and other recent work has exploited the orbit matrix as a symmetry adapted form of the rigidity matrix. This paper explores how the decomposition and analysis of symmetric frameworks and their symmetric … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 32 publications
0
3
0
Order By: Relevance
“…Further applications of Theorem 4.4 and other operations are recently discussed in [ 14 , 15 , 22 ].…”
Section: Constructive Characterization Of Maximum (2 3)-g-tight Grapmentioning
confidence: 99%
See 1 more Smart Citation
“…Further applications of Theorem 4.4 and other operations are recently discussed in [ 14 , 15 , 22 ].…”
Section: Constructive Characterization Of Maximum (2 3)-g-tight Grapmentioning
confidence: 99%
“…The main contributions of this paper are (i) to develop a concise approach to analyze the rigidity of symmetric frameworks based on inductive constructions and (ii) to give the first combinatorial characterization for frameworks with non-cyclic symmetry, which is far more complicated than the cyclic case. After the publication of the technical report [ 8 ] of this paper, our formulation and results on inductive constructions were used for analyzing the infinitesimal rigidity of symmetric frameworks [ 15 , 22 ] and the symmetric-forced rigidity of symmetric frameworks on surfaces [ 14 ]. Also the matroid construction given in Sect.…”
Section: Introductionmentioning
confidence: 99%
“…Proof. Since the equivalence of (1), (2) and (3) can be proven by adapting the technique used in [11,Theorem 3] Then take the bottom component with its edges to the pinned vertices. In R pin DL (G, p) apply a permutation of rows and a permutation of column vertices to place these rows and columns at the top left of the matrix.…”
Section: Assur Graphs and Assur Decompositionsmentioning
confidence: 99%