BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Australia/Melbourne
X-LIC-LOCATION:Australia/Melbourne
BEGIN:DAYLIGHT
TZOFFSETFROM:+1000
TZOFFSETTO:+1100
TZNAME:AEDT
DTSTART:19721003T020000
RRULE:FREQ=YEARLY;BYMONTH=4;BYDAY=1SU
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:19721003T020000
TZOFFSETFROM:+1100
TZOFFSETTO:+1000
TZNAME:AEST
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20240214T070312Z
LOCATION:Meeting Room C4.8\, Level 4 (Convention Centre)
DTSTART;TZID=Australia/Melbourne:20231215T131500
DTEND;TZID=Australia/Melbourne:20231215T141000
UID:siggraphasia_SIGGRAPH Asia 2023_sess157@linklings.com
SUMMARY:Put Things Together
DESCRIPTION:Technical Papers, TOG\n\nLearning Gradient Fields for Scalable
  and Generalizable Irregular Packing\n\nThe packing problem, also known as
  cutting or nesting, has diverse applications in logistics, manufacturing,
  layout design, and atlas generation. It involves arranging irregularly sh
 aped pieces to minimize waste while avoiding overlap. Recent advances in m
 achine learning, particularly reinforcement ...\n\n\nTianyang Xue (Shandon
 g University), Mingdong Wu (Peking University), Lin Lu and Haoxuan Wang (S
 handong University), and Hao Dong and Baoquan Chen (Peking University)\n--
 -------------------\nReconstruction of Machine-Made Shapes from Bitmap Ske
 tches\n\nWe propose a method of reconstructing 3D machine-made shapes from
  bitmap sketches by separating an input image into individual patches and 
 jointly optimizing their geometry. \nWe rely on two main observations:\n(1
 ) human observers interpret sketches of man-made shapes as a collection of
  simple geometr...\n\n\nIvan Puhachov (Universite de Montreal; Huawei Tech
 nologies, Canada); Cedric Martens (Universite de Montreal); Paul G. Kry (M
 cGill University; Huawei Technologies, Canada); and Mikhail Bessmeltsev (U
 niversite de Montreal)\n---------------------\nNeural Packing: from Visual
  Sensing to Reinforcement Learning\n\nWe present a novel learning framewor
 k to solve the transport-and-packing (TAP) problem in 3D. It constitutes a
  full solution pipeline from partial observations of input objects via RGB
 D sensing and recognition to final box placement, via robotic motion plann
 ing, to arrive at a compact packing in a t...\n\n\nJuzhan Xu (Shenzhen Uni
 versity), Minglun Gong (University of Guelph), Hao Zhang (Simon Fraser Uni
 versity), and Hui Huang and Ruizhen Hu (Shenzhen University)\n------------
 ---------\nLearning based 2D Irregular Shape Packing\n\n2D irregular shape
  packing is a necessary step to arrange UV patches of a 3D model within a 
 texture atlas for memory-efficient appearance rendering in computer graphi
 cs. Being a joint, combinatorial decision-making problem involving all pat
 ch positions and orientations, this problem has well-known N...\n\n\nZeshi
  Yang and Zherong Pan (Tencent America), Manyi Li (Shandong University), a
 nd Kui Wu and Xifeng Gao (Tencent America)\n\nRegistration Category: Full 
 Access\n\nSession Chair: Chi Wing Fu (The Chinese University of Hong Kong)
END:VEVENT
END:VCALENDAR