Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
|
Civil-Comp Conferences
ISSN 2753-3239 CCC: 6
PROCEEDINGS OF THE SEVENTEENTH INTERNATIONAL CONFERENCE ON CIVIL, STRUCTURAL AND ENVIRONMENTAL ENGINEERING COMPUTING Edited by: P. Ivanyi, J. Kruis and B.H.V. Topping
Paper 11.4
Braced grid framework rigidity characterization J. Katona and Gy. Nagy Kem
Institute of Civil Engineering, Obuda University, Budapest, Hungary J. Katona, Gy. Nagy Kem, "Braced grid framework rigidity characterization", in P. Ivanyi, J. Kruis, B.H.V. Topping, (Editors), "Proceedings of the Seventeenth International Conference on
Civil, Structural and Environmental Engineering Computing", Civil-Comp Press, Edinburgh, UK,
Online volume: CCC 6, Paper 11.4, 2023, doi:10.4203/ccc.6.11.4
Keywords: bar joint framework, cubic grid, rigidity, scaffolding, directed graph, computational complexity.
Abstract
Bar and joint frameworks present models of engineering structures. The purpose is to
find an efficient algorithm for deciding infinitesimal rigidity in differently braced
three-dimensional. Using the bar-joint structure's symmetry to determine the rigidity
is a problem of long-standing interest in kinematics, statics, and optimization. The
algorithm has applications in robotics as an actuator-controlled mechanism and in
material science as meta-materials and reconfigurable materials. The bar and joint
framework have served as valuable models of the structure of metals, crystal states of
matter, building science, and biological systems. Scaffolding, as repetitive objects, are
helpful as preliminary structures of design. Applying some further bracing elements
such as Cable, Strut, or Rod (bracing bar) the Scaffolding will be rigid. The given
models describe the rigidity of the differently braced scaffolding frameworks and
produce a graph theoretical characterization that provides an efficiently solvable
graph or directed graph as the original structure.
download the full-text of this paper (PDF, 11 pages, 554 Kb)
go to the previous paper |
|