Geometry and Algebra

We work on efficient algorithms in computational geometry and on applying geometric methods in algebraic complexity theory. Our focus lies on approaches that relate these areas to computer algebra and algebraic computations; in particular, we investigate efficient methods for handling curves and surfaces defined by algebraic equations and we study projective varieties that arise in the study of geometric complexity theory. We also make our algorithmic results available in mature software libraries such as CGAL.