Abstract
In this paper, we propose an inductive construction of minimally rigid body-hinge simple graphs. Inductive construction is one of well-studied topics in Combinatorics and Combinatorial Optimization. We develop an inductive construction for minimally rigid body-hinge simple graphs in d-dimension with dāā„ā3 by which we can develop a polynomial-time algorithm for enumerating all minimally rigid body-hinge simple graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Applied MathematicsĀ 65(1), 21ā46 (1996)
Frank, A., SzegĒ«, L.: Constructive characterizations for packing and covering with trees. Discrete Applied MathematicsĀ 131(2), 347ā371 (2003)
Henneberg, L.: Die graphische statik der starren system. Leipzig (1911)
Katoh, N., Tanigawa, S.: A proof of the molecular conjecture. Discrete and Computational GeometryĀ 45, 647ā700 (2011)
Laman, G.: On graphs and rigidity of plane skeletal structures. Journal of Engineering MathematicsĀ 4(4), 331ā340 (1970)
Lee, A., Streinu, I.: Pebble game algorithms and sparse graphs. Discrete MathematicsĀ 308(8), 1425ā1437 (2008)
Nash-Williams, C.: Edge-disjoint spanning trees of finite graphs. Journal of the London Mathematical SocietyĀ 36, 445ā450 (1961)
Roth, A.: The rigidity of graphs. AMSĀ 245, 279ā289 (1979)
Schrijver, A.: Combinatorial Optimization, vol.Ā B, p. 881, Corollary 51.3b. Springer (2003)
Tay, T.: Linking (nāāā2)-dimensional panels in n-space ii:(nāāā2, 2)-frameworks and body and hinge structures. Graphs and CombinatoricsĀ 5(1), 245ā273 (1989)
Tutte, W.T.: On the problem of decomposing a graph into n connected factors. Journal of the London Mathematical SocietyĀ 36, 221ā230 (1961)
Uno, T.: A new approach for speeding up enumeration algorithms and its application for matroid bases. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-I., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.Ā 1627, pp. 349ā359. Springer, Heidelberg (1999)
Whiteley, W.: The union of matroids and the rigidity of frameworks. SIAM Journal on Discrete MathematicsĀ 1(2), 237ā255 (1988)
Whiteley, W.: Some matroids from discrete applied geometry. Contemporary MathematicsĀ 197, 171ā311 (1996)
Whiteley, W.: Rigidity of molecular structures: generic and geometric analysis. In: Thorpe, M.F., Duxbury, P.M. (eds.) Rigidity Theory and Applications, pp. 21ā46 (1999)
Whiteley, W.: Rigidity and scene analysis. In: Goodman, J., ORourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn. ch. 60, pp. 1327ā1354. Chapman Hall/CRC Press, Boca Raton, FL (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Higashikawa, Y., Kamiyama, N., Katoh, N., Kobayashi, Y. (2013). An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs. In: Widmayer, P., Xu, Y., Zhu, B. (eds) Combinatorial Optimization and Applications. COCOA 2013. Lecture Notes in Computer Science, vol 8287. Springer, Cham. https://doi.org/10.1007/978-3-319-03780-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-03780-6_15
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03779-0
Online ISBN: 978-3-319-03780-6
eBook Packages: Computer ScienceComputer Science (R0)