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:20260114T163652Z
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:Efficient Cone Singularity Construction for Conformal Paramete
 rizations\n\nWe propose an efficient method to construct sparse cone singu
 larities under distortion-bounded constraints for conformal parameterizati
 ons. Central to our algorithm is using the technique of shape derivatives 
 to move cones for distortion reduction without changing the number of cone
 s. In particular,...\n\n\nMo Li, Qing Fang, Zheng Zhang, Ligang Liu, and X
 iao-Ming Fu (University of Science and Technology of China)\n-------------
 --------\nLearning the Geodesic Embedding with Graph Neural Networks\n\nWe
  present GeGnn, a learning-based method for computing the approximate geod
 esic distance between two arbitrary points on discrete polyhedra surfaces 
 with constant time complexity after fast precomputation. Previous relevant
  methods either focus on computing the geodesic distance between a single 
 so...\n\n\nBo Pang (Peking Unversity); Zhongtian Zheng (Peking University)
 ; Guoping Wang (Peking Unversity); and Peng-Shuai Wang (Peking University,
  Wangxuan Institute of Computer Technology)\n---------------------\nLock-f
 ree Vertex Clustering for Multicore Mesh Reduction\n\nModern data collecti
 on methods can capture representations of 3D objects at resolutions much g
 reater than they can be discretely rendered as an image. To improve the ef
 ficiency of storage, transmission, rendering, and editing of 3D models con
 structed from such data, it is beneficial to first employ ...\n\n\nNima Fa
 thollahi and Sean Chester (University of Victoria)\n---------------------\
 nMetric Optimization in Penner Coordinates\n\nMany parametrization and map
 ping-related problems in geometry processing can be viewed as metric optim
 ization problems, i.e., computing a metric minimizing a functional and sat
 isfying a set of constraints, such as flatness. \n\nPenner coordinates are
  global coordinates on the space of metrics on meshe...\n\n\nRyan Capouell
 ez and Denis Zorin (New York University)\n---------------------\nZero-Shot
  3D Shape Correspondence\n\nWe propose a novel zero-shot approach to compu
 ting 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-isometric and inter-class s
 hape matching (e.g., human vs. cow)...\n\n\nAhmed Abdelreheem and Abdelrah
 man Eldesokey (King Abdullah University of Science and Technology (KAUST))
 , Maks Ovsjanikov (Centre National de la Recherche Scientifique - Laborato
 ire d'informatique de l'École Polytechnique (LIX)), and Peter Wonka (King 
 Abdullah University of Science and Technology (KAUST))\n\nRegistration Cat
 egory: Full Access\n\nSession Chair: Marco ATTENE (Institute for Applied M
 athematics and Information Technologies (IMATI), CNR)
END:VEVENT
END:VCALENDAR