BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Asia/Hong_Kong
X-LIC-LOCATION:Asia/Hong_Kong
BEGIN:STANDARD
TZOFFSETFROM:+0800
TZOFFSETTO:+0800
TZNAME:HKT
DTSTART:19911015T033000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20251218T030656Z
LOCATION:Meeting Room S423+S424\, Level 4
DTSTART;TZID=Asia/Hong_Kong:20251215T165100
DTEND;TZID=Asia/Hong_Kong:20251215T170200
UID:siggraphasia_SIGGRAPH Asia 2025_sess113_papers_1590@linklings.com
SUMMARY:Chapper: Carvable Hull-and-Pack for Subtractive Manufacturing
DESCRIPTION:Zhenmin Zhang, Shuai Feng, Hao Xu, Lujiaoyang Fu, and Lin Lu (
 Shandong University); Jianwei Guo (Beijing Normal University); and Haisen 
 Zhao (Shandong University)\n\nTightly cutting raw materials into a set of 
 carvable objects, known as the stock cutting problem, is a necessary step 
 in subtractive manufacturing. This problem can be framed as a 3D irregular
  object packing task, aiming to fit as many objects as possible within a p
 redefined container. While previous packing algorithms can generate dense,
  non-overlapping, and even interlocking-free configurations, they cannot s
 atisfy carvable constraints. \n\nThis paper introduces the chapper problem
 , which integrates irregular object packing with subtractive manufacturing
 . This problem is more challenging than general 3D packing, as it requires
  ensuring the carvability of each object and generate the disassembly sequ
 ence. To address this, we first define a novel geometric hull, called carv
 ing hull, which accounts for both the object’s shape and the cutter access
 ibility, constrained by the real-time distribution of surrounding objects.
  Then we present Chapper, an effective solution to co-optimize the plannin
 g of carving hull pack and disassembly sequence to maximize space utilizat
 ion while preserving the carvable constraints. Given a raw material and a 
 list of generic 3D objects, our algorithm starts with densely packing each
  object into the material with a pre-computed placement order, while simul
 taneously maintaining a valid disassembly sequence. We solve the complex o
 bject-to-object and cutter-to-object collisions by leveraging a discrete v
 oxel representation. The carvability of each object is also guaranteed in 
 the packing process, where we define a novel carvable metric to determine 
 whether each object is carvable or not. Based on the packing result and th
 e disassembly sequence, we propose a clipped Voronoi based volume decompos
 ition method to generate the actual carving hull for each object and final
 ly create feasible cutting tool paths on the carving hulls. Our approach e
 ffectively packs CAD and freeform datasets, exhibiting unique space utiliz
 ation rate performance compared to the alternative baseline.\n\nRegistrati
 on Category: Full Access, Full Access Supporter\n\nSession Chair: Peng Son
 g (Singapore University of Technology and Design (SUTD))\n\n
END:VEVENT
END:VCALENDAR