BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Asia/Seoul
X-LIC-LOCATION:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:18871231T000000
DTSTART:19881009T020000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20230103T035348Z
LOCATION:Room 325-AB\, Level 3\, West Wing
DTSTART;TZID=Asia/Seoul:20221208T170000
DTEND;TZID=Asia/Seoul:20221208T183000
UID:siggraphasia_SIGGRAPH Asia 2022_sess171@linklings.com
SUMMARY:Geometric Operations
DESCRIPTION:Technical Communications, Technical Papers\n\nThe presentation
 s will be followed by a 30-min Interactive Discussion Session at Room 325-
 CD.\n\nThe Technical Papers program is the premier international forum for
  disseminating new scholarly work in computer graphics and interactive tec
 hniques. Technical Papers are published as a special issue of ACM Transact
 ions on Graphics. In addition to papers selected by the SIGGRAPH Asia 2022
  Technical Papers Jury, the conference presents papers that have been publ
 ished in ACM Transactions on Graphics during the past year. Accepted paper
 s adhere to the highest scientific standards.\n\nThe Technical Communicati
 ons program is a premier forum for presenting the latest developments and 
 research still in progress. Leading international experts in academia and 
 industry present work that showcase actual implementations of research ide
 as, works at the crossroads of computer graphics with computer vision, mac
 hine learning, HCI, VR, CAD, visualization, and many others\n\nHierarchica
 l Layout Blending with Recursive Optimal Correspondence\n\nXu, Li, Yang, S
 hi, Fu...\n\nWe present a novel method for blending hierarchical layouts w
 ith semantic labels. The core of our method is a hierarchical structure co
 rrespondence algorithm, which recursively finds optimal substructure corre
 spondences, achieving a globally optimal correspondence between a pair of 
 hierarchical layo...\n\n---------------------\nVoronoi Spaghetti & VoroNoo
 dles: Topologically Interlocked, Space-Filling, Corrugated &   Congruent T
 iles\n\nMullins, Ebert, Akleman, Krihnamurthy\n\nIn this work, we introduc
 e an approach to model topologically interlocked corrugated bricks that ca
 n be assembled in a water-tight manner (space-filling) to design a variety
  of spatial structures.\n\n---------------------\nDeclarative Specificatio
 n for Unstructured Mesh Editing Algorithms\n\nJiang, Dai, Hu, Zhou, Dumas.
 ..\n\nWe introduce a novel approach to describe mesh generation, mesh adap
 tation, and geometric modeling algorithms relying on changing mesh connect
 ivity using a high-level abstraction. The main motivation is to enable eas
 y customization and development of these algorithms via a declarative spec
 ification ...\n\n---------------------\nSkinMixer: Blending 3D Animated Mo
 dels\n\nNuvoli, Pietroni, Scateni, Cignoni, Tarini\n\nWe propose a novel t
 echnique to compose new 3D animated models, such as videogame characters, 
 by combining pieces from existing ones. Our method works on production-rea
 dy rigged, skinned, and animated 3D models to reassemble new ones. We expl
 oit Mix-and-match operations on the skeletons to trigger t...\n\n---------
 ------------\nMeshTaichi: A Compiler for Efficient Mesh-based Operations\n
 \nYu, Xu, Kuang, Hu, Liu\n\nMeshes are an indispensable representation in 
 many graphics applications because they provide conformal spatial discreti
 zations. However, mesh-based operations are often slow due to unstructured
  memory access patterns. We propose MeshTaichi, a novel mesh compiler that
  provides an intuitive programmi...\n\n---------------------\nBoolSurf : B
 oolean Operations on Surfaces\n\nRiso, Nazzaro, Puppo, Jacobson, Zhou...\n
 \nWe port Boolean set operations between 2D shapes to surfaces of any genu
 s,  with any number of open boundaries. We combine shapes bounded by sets 
 of freely intersecting loops, consisting of geodesic lines and cubic B\'ez
 ier splines lying on a surface. We compute the arrangement of shapes direc
 tly on...\n\n---------------------\nInteractive and Robust Mesh Booleans\n
 \nCherchi, Pellacini, Attene, Livesu\n\nBoolean operations between objects
  are among the most used paradigms to create and edit digital shapes. Desp
 ite being conceptually simple, the computation of mesh booleans is notorio
 usly challenging. The main issues come mostly from the presence of numeric
 al approximations that make the detection an...\n\n\nRegistration Category
 : FULL ACCESS, ON-DEMAND ACCESS\n\nLanguage: ENGLISH\n\nFormat: IN-PERSON,
  ON-DEMAND
END:VEVENT
END:VCALENDAR