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:20240214T070244Z
LOCATION:Meeting Room C4.8\, Level 4 (Convention Centre)
DTSTART;TZID=Australia/Melbourne:20231213T141500
DTEND;TZID=Australia/Melbourne:20231213T142500
UID:siggraphasia_SIGGRAPH Asia 2023_sess144_papers_950@linklings.com
SUMMARY:Bézier Spline Simplification Using Locally Integrated Error Metric
 s
DESCRIPTION:Technical Papers\n\nSiqi Wang (New York University); Chenxi Li
 u (University of British Columbia); Daniele Panozzo and Denis Zorin (New Y
 ork University); and Alec Jacobson (University of Toronto, Adobe Research)
 \n\nInspired by surface mesh simplification methods, we present a techniqu
 e for reducing the number of Bézier curves in a vector graphics while main
 taining high fidelity. We propose a curve-to-curve distance metric to repe
 atedly conduct local segment removal operations. By construction, we ident
 ify all possible lossless removal operations ensuring the smallest possibl
 e zero-error representation of a given design. Subsequent lossy operations
  are computed via local Gauss-Newton optimization and processed in a prior
 ity queue. We tested our method on the OpenClipArts dataset of 20,000 real
 -world vector graphics images and show significant improvements over repre
 sentative previous methods. The generality of our method allows us to show
  results for curves with varying thickness and for vector graphics animati
 ons.\n\nRegistration Category: Full Access\n\nSession Chair: Oded Stein (U
 niversity of Southern California, MIT)
URL:https://asia.siggraph.org/2023/full-program?id=papers_950&sess=sess144
END:VEVENT
END:VCALENDAR