Abstract
We define a truss family Ti by a statically determinate truss T0 and a recursive step Ti+1=f(Ti), such that Ti+1Ti and that step f(Ti) keeps static determinacy. Such recursive algorithms have been broadly discussed in the literature, e.g. the Henneberg operation 1 is a well-known example. Earlier we introduced the concept of geometric sensitivity index rg of trusses, here we investigate the sensitivity of truss families, in particular, the limit sensitivity (Ti).
Highlights
Generating algorithms for statically determinate trusses was first discussed by Henneberg [5] who proved that each of such trusses can be generated by the repetitions of the so-called
3 Geometric sensitivity of truss families In previous sections we showed the generating operations, from which the recursive algorithms of the families are built up; we introduced the truss classes, to which the families belong to, and we illustrated the topology types, among which some of the families can be ranged
The geometric sensitivity matrix Rg of a truss is defined as a matrix, which makes connections between the internal joints and their influenced zones in the following way: rgij=1, if the influenced zone of the internal joint j contains bar i, rgij=0, if not
Summary
Generating algorithms for statically determinate trusses was first discussed by Henneberg [5] who proved that each of such trusses can be generated by the repetitions of the so-calledHenneberg operations H1 and H2. Keywords geometric sensitivity · Henneberg operations · method of substitute members · topology of trusses · minimal rigidity · truss types
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
