Skip to main content

2012 | OriginalPaper | Buchkapitel

9. Geometric Constraints Resulting From Puzzles

verfasst von : Liping Zhang, Jian S. Dai

Erschienen in: Advances in Reconfigurable Mechanisms and Robots I

Verlag: Springer London

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Wooden puzzles consisting of interlocking assembly of notched sticks are often referred to as bar-puzzles, sometime known as the Chinese Puzzles or Chinese Cross. By far the more familiar of three-dimensional puzzles in general is the multi-piece bar. But there does not appear to be any evidence that the idea of its mechanism property and any configuration analysis originated. To this purpose, this paper proposes a static and discrete reconfiguration theory of geometric puzzles for modeling the topology changement as Put Together, Take Apart, Sequential Movement and various others. The partition and assembly process analysis aims to extract the kinematic chains as links and joints. The puzzle unlocking leads to configuration constraints rearrangement problems which accompanying pieces of bars self-grouped as defined reconfiguration links and joints. The puzzle solutions are first described as reconfigurable topology mechanism and the constrained mobility is analyzed based on an ingenious and distinctive reconfiguration property.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Coffin S (2007) Geometric puzzle design. A K Peters Ltd., Wellesley Coffin S (2007) Geometric puzzle design. A K Peters Ltd., Wellesley
2.
Zurück zum Zitat Garey MR, Johnson DS, Tarjan RE (1976) The Planar Hamiltonian circuit problem is NP-complete. SIAM J Comput 5(4):704–714 Garey MR, Johnson DS, Tarjan RE (1976) The Planar Hamiltonian circuit problem is NP-complete. SIAM J Comput 5(4):704–714
3.
Zurück zum Zitat Robertson E, Munro I (1978) NP-completeness, puzzles, and games. Utilitas Math 13:99–116MathSciNet Robertson E, Munro I (1978) NP-completeness, puzzles, and games. Utilitas Math 13:99–116MathSciNet
4.
Zurück zum Zitat Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H Freeman, New YorkMATH Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H Freeman, New YorkMATH
5.
Zurück zum Zitat Ratner D, Warmuth M (1990) Finding a shortest solution for the N_N-extension of the 15-puzzle is intractable. J Symb Comp 10:111–137MathSciNetMATHCrossRef Ratner D, Warmuth M (1990) Finding a shortest solution for the N_N-extension of the 15-puzzle is intractable. J Symb Comp 10:111–137MathSciNetMATHCrossRef
6.
Zurück zum Zitat Demaine ED (2001) Playing games with algorithms: algorithmic combinatorial game theory. In: Proceedings of the mathematical foundations of computer science, pp 18–32 Demaine ED (2001) Playing games with algorithms: algorithmic combinatorial game theory. In: Proceedings of the mathematical foundations of computer science, pp 18–32
8.
Zurück zum Zitat Demaine ED, Demaine ML, Eppstein D, Frederickson DG, Friedman E (2005) Hinged dissection of polyominoes and polyforms. Comput Geom Theory Appl 31(3):237–262 Demaine ED, Demaine ML, Eppstein D, Frederickson DG, Friedman E (2005) Hinged dissection of polyominoes and polyforms. Comput Geom Theory Appl 31(3):237–262
9.
Zurück zum Zitat Jackson P (1989) Origami: a complete step-by-step guide. Hamlyn Publishing Group Ltd, London Jackson P (1989) Origami: a complete step-by-step guide. Hamlyn Publishing Group Ltd, London
10.
Zurück zum Zitat Dai JS, Jones RJ (1998) Mobility in metamorphic mechanisms of foldable/erectable kinds. 25th ASME biennial mechanisms and robotics conference, Atlanta, Sept 1998 Dai JS, Jones RJ (1998) Mobility in metamorphic mechanisms of foldable/erectable kinds. 25th ASME biennial mechanisms and robotics conference, Atlanta, Sept 1998
11.
Zurück zum Zitat Wohlhart K (1996) Kinematotropic linkages. In: Lenarcic J, Parenti-Castelli V (eds) Recent advances in robot kinematics, Kluwer Academic, Dordrecht, pp 359–368 Wohlhart K (1996) Kinematotropic linkages. In: Lenarcic J, Parenti-Castelli V (eds) Recent advances in robot kinematics, Kluwer Academic, Dordrecht, pp 359–368
12.
Zurück zum Zitat Zhang LP, Wang DL, Dai JS (2008) Biological modeling and evolution based synthesis of metamorphic mechanisms. Trans ASME J Mech Des 130(7):072303-1-11 Zhang LP, Wang DL, Dai JS (2008) Biological modeling and evolution based synthesis of metamorphic mechanisms. Trans ASME J Mech Des 130(7):072303-1-11
13.
Zurück zum Zitat Zhang LP, Dai JS (2009) Spatial metamorphic mechanisms reconfiguration. Trans ASME J Mech Robotics 1:011012-1-8 Zhang LP, Dai JS (2009) Spatial metamorphic mechanisms reconfiguration. Trans ASME J Mech Robotics 1:011012-1-8
Metadaten
Titel
Geometric Constraints Resulting From Puzzles
verfasst von
Liping Zhang
Jian S. Dai
Copyright-Jahr
2012
Verlag
Springer London
DOI
https://doi.org/10.1007/978-1-4471-4141-9_9