University of Cambridge > > Isaac Newton Institute Seminar Series > Newest Results in Newest Vertex Bisection

Newest Results in Newest Vertex Bisection

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact INI IT.

GCS - Geometry, compatibility and structure preservation in computational differential equations

The algorithmic refinement of triangular meshes is an important 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 many combinatorial aspects of this method are not yet fully understood. In this talk, we access newest vertex bisection from the perspective of theoretical computer science. We outline the amortized complexity analysis over generalized triangulations. An immediate application is the convergence and complexity analysis of adaptive finite element methods over embedded surfaces and singular surfaces. Moreover, we “combinatorialize” the complexity estimate and remove any geometry-dependent constants, which is only natural for this purely combinatorial algorithm and improves upon prior results. This is joint work with Michael Holst and Zhao Lyu.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity