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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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)