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:20230103T035306Z LOCATION:Auditorium\, Level 5\, West Wing DTSTART;TZID=Asia/Seoul:20221206T100000 DTEND;TZID=Asia/Seoul:20221206T120000 UID:siggraphasia_SIGGRAPH Asia 2022_sess153_papers_215@linklings.com SUMMARY:Globally Injective Flattening via a Reduced Harmonic Subspace DESCRIPTION:Technical Papers\n\nGlobally Injective Flattening via a Reduce d Harmonic Subspace\n\nFargion, Weber\n\nWe present a highly efficient-and -robust method for free-boundary flattening of disk-like triangle meshes i n a globally injective manner. We show that by restricting the solution to a low-dimensional subspace of harmonic maps, we can dramatically accelera te the process while obtaining a low-distortion result. The algorithm cons ists of two main steps. A linear subspace construction, and a nonlinear no nconvex optimization for finding a low-distortion globally injective map w ithin that subspace. The complexity of the first step dominates the algori thm's runtime and is merely that of solving a linear system. We combine re cent results for computing locally-and-globally injective maps with that o f harmonic maps into a conceptually simple algorithm that guarantees globa l injectivity. We demonstrate the great efficiency of our method over a da taset of 100 large scale models with more than 2M triangles each. Our algo rithm is 10 times faster on average compared to the state-of-the-art Effic ient Bijective Parameterizations (EBP) method [Su et al. 2020], on these h igh-resolution meshes, and more than 20 times faster on challenging exampl es. The speedup over [Jiang et al. 2017; Smith and Schaefer 2015] is even more dramatic.\n\nRegistration Category: FULL ACCESS, EXPERIENCE PLUS ACCE SS, EXPERIENCE ACCESS, TRADE EXHIBITOR\n\nLanguage: ENGLISH\n\nFormat: IN- PERSON URL:https://sa2022.siggraph.org/en/full-program/?id=papers_215&sess=sess15 3 END:VEVENT END:VCALENDAR