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 S421\, Level 4
DTSTART;TZID=Asia/Hong_Kong:20251216T112300
DTEND;TZID=Asia/Hong_Kong:20251216T113400
UID:siggraphasia_SIGGRAPH Asia 2025_sess159_papers_1136@linklings.com
SUMMARY:Inverse Tiling of 2D Finite Domains
DESCRIPTION:Rulin Chen (Singapore University of Technology and Design (SUT
 D), Beijing Normal–Hong Kong Baptist University); Xuyang Ma and Praveer Te
 wari (Singapore University of Technology and Design (SUTD)); Chi-Wing Fu (
 Chinese University of Hong Kong); and Peng Song (Singapore University of T
 echnology and Design (SUTD))\n\nA K-hedral tiling of a 2D finite domain is
  a covering of the domain with tiles without gaps or overlaps, where each 
 tile is congruent to one of the K distinct shapes called prototiles. K, th
 e number of prototiles, is preferred to be as small as possible for congru
 ent tiling appearance and reducing fabrication cost, e.g., by molding. Typ
 ically, a forward approach is adopted to produce Khedral tilings by prescr
 ibing a set of prototiles and placing prototile instances (i.e., tiles) to
  cover the input domain. However, the prescribed prototile set may not be 
 sufficient to tile the domain (for small K) or may lead to tiling results 
 with excessive prototiles more than needed (for large K).\n\nIn this work,
  we formulate a new tiling problem called inverse tiling for producing K-h
 edral tilings in 2D finite domains, where the prototile set is inversely m
 odeled to fit the input domain instead of being prescribed. Since the prot
 otile set is unknown, inverse tiling allows exploring a large search space
  to discover a minimized number of prototiles for tiling the input domain.
  To solve the inverse tiling problem, we propose a computational approach 
 that progressively builds the prototile set while tiling the input domain,
  starting from a prototile set with a single element. Once a tiling result
  is obtained, the approach further reduces the number of prototiles by loc
 ally re-tiling the input domain to eliminate prototiles with few instances
 . We demonstrate the effectiveness of our inverse tiling approach on a var
 iety of finite domains, evaluate its performance in scalability and K mini
 mization, and compare it quantitatively with forward tiling approaches.\n\
 nRegistration Category: Full Access, Full Access Supporter\n\nSession Chai
 r: Lin Lu (Shandong University)\n\n
END:VEVENT
END:VCALENDAR