BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: The Plantinga-Vegter algorithm is a subdivision algorithm that
produces an isotopic approximation of implicit smooth curves in the plane
(and also of surfaces in the three dimensional space). Despite remarkable p
ractical success of the algorithm\, little was known about its complexity.
The only existing complexity analysis due to Burr\, Gao and Tsigaridas prov
ides worst-case bounds that are exponential both in the degree and the bit
size of the input polynomial. Despite being tight\, this worst-case bound d
oesn't explain why the algorithm is efficient in practice. In this talk\, w
e show how condition numbers\, combined with techniques from geometric func
tional analysis\, help to solve this issue. This is joint work with Alperen
A. Ergür and Felipe Cucker.
DTSTAMP:20190417T153300
DTSTART:20190415T160000
CLASS:PUBLIC
LOCATION:Freie Universität Berlin \n Institut für Informatik \n Takustr. 9
\n 14195 Berlin \n Room 005 (Ground Floor)
SEQUENCE:0
SUMMARY:Josué Tonelli-Cueto (Technische Universität Berlin): Condition meet
s Computational Geometry: The Plantinga-Vegter algorithm case
UID:95690502@www.facetsofcomplexity.de
URL:http://www.facetsofcomplexity.de/monday/20190415-C-Cueto.html
END:VEVENT
END:VCALENDAR