Solving jigsaw puzzles by computer
Annals of Operations Research
A global approach to automatic solution of jigsaw puzzles
Proceedings of the eighteenth annual symposium on Computational geometry
Making papercraft toys from meshes using strip-based approximate unfolding
ACM SIGGRAPH 2004 Papers
A Texture Based Matching Approach for Automated Assembly of Puzzles
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 03
Digital bas-relief from 3D scenes
ACM SIGGRAPH 2007 papers
Plushie: an interactive design system for plush toys
ACM SIGGRAPH 2007 papers
ACM SIGGRAPH 2008 papers
ACM SIGGRAPH Asia 2009 papers
ACM SIGGRAPH Asia 2009 papers
Origamizing Polyhedral Surfaces
IEEE Transactions on Visualization and Computer Graphics
ACM SIGGRAPH 2010 papers
Popup: automatic paper architectures from 3D models
ACM SIGGRAPH 2010 papers
Converting 3D furniture models to fabricatable parts and connectors
ACM SIGGRAPH 2011 papers
Making burr puzzles from 3D models
ACM SIGGRAPH 2011 papers
A geometric study of v-style pop-ups: theories and algorithms
ACM SIGGRAPH 2011 papers
Computing and fabricating multilayer models
Proceedings of the 2011 SIGGRAPH Asia Conference
crdbrd: Shape Fabrication by Sliding Planar Slices
Computer Graphics Forum
SMI 2013: Illustrating the disassembly of 3D models
Computers and Graphics
| Hi-index | 0.00 |
Interlocking puzzles are very challenging geometric problems with the fascinating property that once we solve one by putting together the puzzle pieces, the puzzle pieces interlock with one another, preventing the assembly from falling apart. Though interlocking puzzles have been known for hundreds of years, very little is known about the governing mechanics. Thus, designing new interlocking geometries is basically accomplished with extensive manual effort or expensive exhaustive search with computers. In this paper, we revisit the notion of interlocking in greater depth, and devise a formal method of the interlocking mechanics. From this, we can develop a constructive approach for devising new interlocking geometries that directly guarantees the validity of the interlocking instead of exhaustively testing it. In particular, we focus on an interesting subclass of interlocking puzzles that are recursive in the sense that the assembly of puzzle pieces can remain an interlocking puzzle also after sequential removal of pieces; there is only one specific sequence of assembling, or disassembling, such a puzzle. Our proposed method can allow efficient generation of recursive interlocking geometries of various complexities, and by further realizing it with LEGO bricks, we can enable the hand-built creation of custom puzzle games.