BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Newest Results in Newest Vertex Bisection - Martin Licht (UC San D
 iego\; University of California\, San Diego)
DTSTART:20190925T130500Z
DTEND:20190925T135000Z
UID:TALK131680@talks.cam.ac.uk
CONTACT:INI IT
DESCRIPTION:The algorithmic refinement of triangular meshes is an importan
 t component in numerical simulation codes. Newest vertex bisection is one 
 of the most popular methods for geometrically stable local refinement. Its
  complexity analysis\, however\, is a fairly intricate recent result and m
 any combinatorial aspects of this method are not yet fully understood. In 
 this talk\, we access newest vertex bisection from the perspective of theo
 retical computer science. We outline the amortized complexity analysis ove
 r generalized triangulations. An immediate application is the convergence 
 and complexity analysis of adaptive finite element methods over embedded s
 urfaces and singular surfaces. Moreover\, we "combinatorialize" the comple
 xity estimate and remove any geometry-dependent constants\, which is only 
 natural for this purely combinatorial algorithm and improves upon prior re
 sults. This is joint work with Michael Holst and Zhao Lyu.<br><br><br><br>
 <br>
LOCATION:Seminar Room 2\, Newton Institute
END:VEVENT
END:VCALENDAR