Home > Research > Publications & Outputs > Assur decompositions of direction-length framew...

Electronic data

  • NixonAssurDirectionLength

    Accepted author manuscript, 143 KB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

Assur decompositions of direction-length frameworks

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNChapter (peer-reviewed)peer-review

Published

Standard

Assur decompositions of direction-length frameworks. / Nixon, Anthony.
Graphs and Combinatorial Optimization : from Theory to Applications : CTW2020 Proceedings. ed. / Claudio Gentile; Giuseppe Stecca; Paolo Ventura. Cham: Springer, 2020. p. 131-143 (AIRO Springer).

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNChapter (peer-reviewed)peer-review

Harvard

Nixon, A 2020, Assur decompositions of direction-length frameworks. in C Gentile, G Stecca & P Ventura (eds), Graphs and Combinatorial Optimization : from Theory to Applications : CTW2020 Proceedings. AIRO Springer, Springer, Cham, pp. 131-143, 18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 14/09/20. https://doi.org/10.1007/978-3-030-63072-0_11

APA

Nixon, A. (2020). Assur decompositions of direction-length frameworks. In C. Gentile, G. Stecca, & P. Ventura (Eds.), Graphs and Combinatorial Optimization : from Theory to Applications : CTW2020 Proceedings (pp. 131-143). (AIRO Springer). Springer. https://doi.org/10.1007/978-3-030-63072-0_11

Vancouver

Nixon A. Assur decompositions of direction-length frameworks. In Gentile C, Stecca G, Ventura P, editors, Graphs and Combinatorial Optimization : from Theory to Applications : CTW2020 Proceedings. Cham: Springer. 2020. p. 131-143. (AIRO Springer). doi: 10.1007/978-3-030-63072-0_11

Author

Nixon, Anthony. / Assur decompositions of direction-length frameworks. Graphs and Combinatorial Optimization : from Theory to Applications : CTW2020 Proceedings. editor / Claudio Gentile ; Giuseppe Stecca ; Paolo Ventura. Cham : Springer, 2020. pp. 131-143 (AIRO Springer).

Bibtex

@inbook{75cdef7dea214939b7cc14d4458d9d18,
title = "Assur decompositions of direction-length frameworks",
abstract = "A bar-joint framework is a realisation of a graph consisting of stiff barslinked by universal joints. The framework is rigid if the only bar-length preserving continuous motions of the joints arise from isometries. A rigid framework is isostatic if deleting any single edge results in a flexible framework. Generically, rigidity depends only on the graph and we say an Assur graph is a pinned isostatic graph with no proper pinned isostatic subgraphs. Any pinned isostatic graph can be decomposed into Assur components which may be of use for mechanical engineers in decomposing mechanisms for simpler analysis and synthesis. A direction-length framework is a generalisation of bar-joint framework where some distance constraints are replaced by direction constraints. We initiate a theory of Assur graphs and Assur decompositions for direction-length frameworks using graph orientations and spanning trees and then analyse choices of pinning set.",
keywords = "Assur decomposition, Assur graph, Bar-joint framework, Direction-length framework, Pinned framework, Rigid graph",
author = "Anthony Nixon",
year = "2020",
month = nov,
day = "9",
doi = "10.1007/978-3-030-63072-0_11",
language = "English",
isbn = "9783030630713",
series = "AIRO Springer",
publisher = "Springer",
pages = "131--143",
editor = "Claudio Gentile and Giuseppe Stecca and Paolo Ventura",
booktitle = "Graphs and Combinatorial Optimization : from Theory to Applications",
note = "18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2020 ; Conference date: 14-09-2020 Through 16-09-2020",
url = "http://ctw2020.iasi.cnr.it/",

}

RIS

TY - CHAP

T1 - Assur decompositions of direction-length frameworks

AU - Nixon, Anthony

PY - 2020/11/9

Y1 - 2020/11/9

N2 - A bar-joint framework is a realisation of a graph consisting of stiff barslinked by universal joints. The framework is rigid if the only bar-length preserving continuous motions of the joints arise from isometries. A rigid framework is isostatic if deleting any single edge results in a flexible framework. Generically, rigidity depends only on the graph and we say an Assur graph is a pinned isostatic graph with no proper pinned isostatic subgraphs. Any pinned isostatic graph can be decomposed into Assur components which may be of use for mechanical engineers in decomposing mechanisms for simpler analysis and synthesis. A direction-length framework is a generalisation of bar-joint framework where some distance constraints are replaced by direction constraints. We initiate a theory of Assur graphs and Assur decompositions for direction-length frameworks using graph orientations and spanning trees and then analyse choices of pinning set.

AB - A bar-joint framework is a realisation of a graph consisting of stiff barslinked by universal joints. The framework is rigid if the only bar-length preserving continuous motions of the joints arise from isometries. A rigid framework is isostatic if deleting any single edge results in a flexible framework. Generically, rigidity depends only on the graph and we say an Assur graph is a pinned isostatic graph with no proper pinned isostatic subgraphs. Any pinned isostatic graph can be decomposed into Assur components which may be of use for mechanical engineers in decomposing mechanisms for simpler analysis and synthesis. A direction-length framework is a generalisation of bar-joint framework where some distance constraints are replaced by direction constraints. We initiate a theory of Assur graphs and Assur decompositions for direction-length frameworks using graph orientations and spanning trees and then analyse choices of pinning set.

KW - Assur decomposition

KW - Assur graph

KW - Bar-joint framework

KW - Direction-length framework

KW - Pinned framework

KW - Rigid graph

U2 - 10.1007/978-3-030-63072-0_11

DO - 10.1007/978-3-030-63072-0_11

M3 - Chapter (peer-reviewed)

SN - 9783030630713

SN - 9783030630744

T3 - AIRO Springer

SP - 131

EP - 143

BT - Graphs and Combinatorial Optimization : from Theory to Applications

A2 - Gentile, Claudio

A2 - Stecca, Giuseppe

A2 - Ventura, Paolo

PB - Springer

CY - Cham

T2 - 18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization

Y2 - 14 September 2020 through 16 September 2020

ER -