Computational Design of Steady 3D Dissection Puzzles. (7th June 2019)

• Record Type: Journal Article
• Authors: Tang, Keke; Song, Peng; Wang, Xiaofei; Deng, Bailin; Fu, Chi‐Wing; Liu, Ligang
• Is Part Of: Computer graphics forum. Volume 38:Number 2(2019)
• Page Start: 291
• Page End: 303
• Publication Date: 2019-06-07
• Subjects: CCS Concepts -- Computing methodologies → Shape modeling -- Applied computing → Computer‐aided manufacturing; Computer graphics -- Periodicals; 006.605
• DOI: 10.1111/cgf.13638
• Languages: English
• ISSNs: 0167-7055

Abstract

Abstract: Dissection puzzles require assembling a common set of pieces into multiple distinct forms. Existing works focus on creating 2D dissection puzzles that form primitive or naturalistic shapes. Unlike 2D dissection puzzles that could be supported on a tabletop surface, 3D dissection puzzles are preferable to be steady by themselves for each assembly form. In this work, we aim at computationally designing steady 3D dissection puzzles . We address this challenging problem with three key contributions. First, we take two voxelized shapes as inputs and dissect them into a common set of puzzle pieces, during which we allow slightly modifying the input shapes, preferably on their internal volume, to preserve the external appearance. Second, we formulate a formal model of generalized interlocking for connecting pieces into a steady assembly using both their geometric arrangements and friction. Third, we modify the geometry of each dissected puzzle piece based on the formal model such that each assembly form is steady accordingly. We demonstrate the effectiveness of our approach on a wide variety of shapes, compare it with the state‐of‐the‐art on 2D and 3D examples, and fabricate some of our designed puzzles to validate their steadiness.