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:20251218T030657Z
LOCATION:Meeting Room S421\, Level 4
DTSTART;TZID=Asia/Hong_Kong:20251216T110100
DTEND;TZID=Asia/Hong_Kong:20251216T111200
UID:siggraphasia_SIGGRAPH Asia 2025_sess159_papers_1432@linklings.com
SUMMARY:Computational Design of Shape-Aware Sieves
DESCRIPTION:David Cha and Oded Stein (University of Southern California)\n
 \nWe introduce mathematical tools to describe the geometric problem of sie
 ves, two-dimensional holes that admit certain three-dimensional objects to
  pass through them, but block others.\nThis is achieved by formulating the
  sieve design problem as a two-player game where both players (the one tha
 t wants to pass, and the one that wants to block) try to find a set of rig
 id transformations to achieve their objective. We also introduce an algori
 thm for solving this game by solving a global optimization problem employi
 ng both differentiable rendering with gradient-based optimization as well 
 as particle swarm optimization.\nOur procedure accounts for real-world man
 ufacturing concerns, and we fabricate a variety of examples demonstrating 
 the practical viability of our sieves. Our implementation takes advantage 
 of GPUs, and does not rely on any clean or manifold input geometry as long
  as it is a triangle mesh.\nWe can produce intricate sieves that block an 
 arbitrary set of shapes B but admit another arbitrary set of shapes A (if 
 finding a solution is possible for our method).\n\nRegistration Category: 
 Full Access, Full Access Supporter\n\nSession Chair: Lin Lu (Shandong Univ
 ersity)\n\n
END:VEVENT
END:VCALENDAR