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:20230103T035312Z
LOCATION:Room 324\, Level 3\, West Wing
DTSTART;TZID=Asia/Seoul:20221209T090000
DTEND;TZID=Asia/Seoul:20221209T103000
UID:siggraphasia_SIGGRAPH Asia 2022_sess172_papers_215@linklings.com
SUMMARY:Globally Injective Flattening via a Reduced Harmonic Subspace
DESCRIPTION:Technical Communications, Technical Papers\n\nGlobally Injecti
 ve Flattening via a Reduced Harmonic Subspace\n\nFargion, Weber\n\nWe pres
 ent a highly efficient-and-robust method for free-boundary flattening of d
 isk-like triangle meshes in a globally injective manner. We show that by r
 estricting the solution to a low-dimensional subspace of harmonic maps, we
  can dramatically accelerate the process while obtaining a low-distortion 
 result. The algorithm consists of two main steps. A linear subspace constr
 uction, and a nonlinear nonconvex optimization for finding a low-distortio
 n globally injective map within that subspace. The complexity of the first
  step dominates the algorithm's runtime and is merely that of solving a li
 near system. We combine recent results for computing locally-and-globally 
 injective maps with that of harmonic maps into a conceptually simple algor
 ithm that guarantees global injectivity. We demonstrate the great efficien
 cy of our method over a dataset of 100 large scale models with more than 2
 M triangles each. Our algorithm is 10 times faster on average compared to 
 the state-of-the-art Efficient Bijective Parameterizations (EBP) method [S
 u et al. 2020], on these high-resolution meshes, and more than 20 times fa
 ster on challenging examples. The speedup over [Jiang et al. 2017; Smith a
 nd Schaefer 2015] is even more dramatic.\n\nRegistration Category: FULL AC
 CESS, ON-DEMAND ACCESS\n\nLanguage: ENGLISH\n\nFormat: IN-PERSON, ON-DEMAN
 D
URL:https://sa2022.siggraph.org/en/full-program/?id=papers_215&sess=sess17
 2
END:VEVENT
END:VCALENDAR