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:20240214T070247Z
LOCATION:Meeting Room C4.8\, Level 4 (Convention Centre)
DTSTART;TZID=Australia/Melbourne:20231214T103500
DTEND;TZID=Australia/Melbourne:20231214T105000
UID:siggraphasia_SIGGRAPH Asia 2023_sess149_papers_1056@linklings.com
SUMMARY:Efficient Cone Singularity Construction for Conformal Parameteriza
 tions
DESCRIPTION:Technical Papers\n\nMo Li, Qing Fang, Zheng Zhang, Ligang Liu,
  and Xiao-Ming Fu (University of Science and Technology of China)\n\nWe pr
 opose an efficient method to construct sparse cone singularities under dis
 tortion-bounded constraints for conformal parameterizations. Central to ou
 r algorithm is using the technique of shape derivatives to move cones for 
 distortion reduction without changing the number of cones. In particular, 
 the supernodal sparse Cholesky update significantly accelerates this movem
 ent process. To satisfy the distortion-bounded constraint, we alternatingl
 y move cones and add cones. The capability and feasibility of our approach
  are demonstrated over a data set containing 3885 models. Compared with th
 e state-of-the-art method, we achieve an average acceleration of 15 times 
 and slightly fewer cones for the same amount of distortion.\n\nRegistratio
 n Category: Full Access\n\nSession Chair: Marco ATTENE (Institute for Appl
 ied Mathematics and Information Technologies (IMATI), CNR)
URL:https://asia.siggraph.org/2023/full-program?id=papers_1056&sess=sess14
 9
END:VEVENT
END:VCALENDAR