Disentangling Topological Puzzles by Using Knot Theory

@article{Horak2006DisentanglingTP,
  title={Disentangling Topological Puzzles by Using Knot Theory},
  author={Matthew Horak},
  journal={Mathematics Magazine},
  year={2006},
  volume={79},
  pages={368 - 375}
}
  • Matthew Horak
  • Published 1 December 2006
  • Philosophy
  • Mathematics Magazine
Mathematical puzzles have been a source of entertainment and inspiration throughout the ages, and many puzzles have contributed to the development of large fields of mathematics. For example, a puzzle from the 18th century known as the Königsberg bridge problem asks the solver whether or not it is possible to trace a path around the city of Königsberg that crosses each of the city’s seven bridges between two islands and the banks of the Pregel River exactly once. Some experimentation easily… 

An Introduction to Computer Graphics for Artists

TLDR
All students wanting to learn more about computer graphics from an artistic viewpoint, particularly those intending to pursue a career in computer game design or film animation, will find this book invaluable.

On some impossible disentanglement puzzles

In this article we prove the impossibility of some disentanglement puzzles, first building mathematical models that reflect the essential characteristics of these puzzles.

CG Modeling 2: NURBS

TLDR
NURBS geometry is used to create mathematically accurate curved surfaces, such as those in automobiles and airplanes, that render well and are more easily controlled for animation than dense polygonal meshes.

Construction of 3D models of the Earth's surface in urban environments using remote sensing technologies

TLDR
A new approach of construction of 3D-models of the Earth's surface in urban environments using remote sensing technologies is proposed, using the use of the algebra of geometric objects to automate the process of multidimensional modeling.

References

SHOWING 1-3 OF 3 REFERENCES

Tangle Complexity and the Topology of the Chinese Rings

TLDR
This paper discusses a question in complexity of untanglement of graph embeddings in relation to the well-known Chinese Rings puzzle in which the complexity ofUntanglement is conjectured to rise exponentially as a function of the structural complexity of the associated graphs.

The Knot Book

Are you looking to uncover the knot book Digitalbook. Correct here it is possible to locate as well as download the knot book Book. We've got ebooks for every single topic the knot book accessible

Which Rectangular Chessboards Have a Knight's Tour?

(1991). Which Rectangular Chessboards Have a Knight's Tour? Mathematics Magazine: Vol. 64, No. 5, pp. 325-332.