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:20260114T163710Z
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:Siqi Wang (New York University); Chenxi Liu (University of Bri
 tish Columbia); Daniele Panozzo and Denis Zorin (New York University); and
  Alec Jacobson (University of Toronto, Adobe Research)\n\nInspired by surf
 ace mesh simplification methods, we present a technique for reducing the n
 umber of Bézier curves in a vector graphics while maintaining high fidelit
 y. We propose a curve-to-curve distance metric to repeatedly conduct local
  segment removal operations. By construction, we identify all possible los
 sless removal operations ensuring the smallest possible zero-error represe
 ntation of a given design. Subsequent lossy operations are computed via lo
 cal Gauss-Newton optimization and processed in a priority queue. We tested
  our method on the OpenClipArts dataset of 20,000 real-world vector graphi
 cs images and show significant improvements over representative previous m
 ethods. The generality of our method allows us to show results for curves 
 with varying thickness and for vector graphics animations.\n\nRegistration
  Category: Full Access\n\nSession Chair: Oded Stein (Technion, University 
 of Southern California)\n\n
URL:https://asia.siggraph.org/2023/full-program?id=papers_950&sess=sess144
END:VEVENT
END:VCALENDAR