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:20240214T070311Z
LOCATION:Meeting Room C4.8\, Level 4 (Convention Centre)
DTSTART;TZID=Australia/Melbourne:20231214T102000
DTEND;TZID=Australia/Melbourne:20231214T112500
UID:siggraphasia_SIGGRAPH Asia 2023_sess149@linklings.com
SUMMARY:Embed to a Different Space
DESCRIPTION:Technical Papers\n\nLearning the Geodesic Embedding with Graph
  Neural Networks\n\nWe present GeGnn, a learning-based method for computin
 g the approximate geodesic distance between two arbitrary points on discre
 te polyhedra surfaces with constant time complexity after fast precomputat
 ion. Previous relevant methods either focus on computing the geodesic dist
 ance between a single so...\n\n\nBo Pang (Peking Unversity); Zhongtian Zhe
 ng (Peking University); Guoping Wang (Peking Unversity); and Peng-Shuai Wa
 ng (Peking University, Wangxuan Institute of Computer Technology)\n-------
 --------------\nZero-Shot 3D Shape Correspondence\n\nWe propose a novel ze
 ro-shot approach to computing correspondences\nbetween 3D shapes. Existing
  approaches mainly focus on isometric and\nnear-isometric shape pairs (e.g
 ., human vs. human), but less attention has\nbeen given to strongly non-is
 ometric and inter-class shape matching (e.g., human vs. cow)...\n\n\nAhmed
  Abdelreheem and Abdelrahman Eldesokey (King Abdullah University of Scienc
 e and Technology (KAUST)), Maks Ovsjanikov (Centre National de la Recherch
 e Scientifique - Laboratoire d'informatique de l'École Polytechnique (LIX)
 ), and Peter Wonka (King Abdullah University of Science and Technology (KA
 UST))\n---------------------\nMetric Optimization in Penner Coordinates\n\
 nMany parametrization and mapping-related problems in geometry processing 
 can be viewed as metric optimization problems, i.e., computing a metric mi
 nimizing a functional and satisfying a set of constraints, such as flatnes
 s. \n\nPenner coordinates are global coordinates on the space of metrics o
 n meshe...\n\n\nRyan Capouellez and Denis Zorin (New York University)\n---
 ------------------\nLock-free Vertex Clustering for Multicore Mesh Reducti
 on\n\nModern data collection methods can capture representations of 3D obj
 ects at resolutions much greater than they can be discretely rendered as a
 n image. To improve the efficiency of storage, transmission, rendering, an
 d editing of 3D models constructed from such data, it is beneficial to fir
 st employ ...\n\n\nNima Fathollahi and Sean Chester (University of Victori
 a)\n---------------------\nEfficient Cone Singularity Construction for Con
 formal Parameterizations\n\nWe propose an efficient method to construct sp
 arse cone singularities under distortion-bounded constraints for conformal
  parameterizations. Central to our algorithm is using the technique of sha
 pe derivatives to move cones for distortion reduction without changing the
  number of cones. In particular,...\n\n\nMo Li, Qing Fang, Zheng Zhang, Li
 gang Liu, and Xiao-Ming Fu (University of Science and Technology of China)
 \n\nRegistration Category: Full Access\n\nSession Chair: Marco ATTENE (Ins
 titute for Applied Mathematics and Information Technologies (IMATI), CNR)
END:VEVENT
END:VCALENDAR