Computational Geometry Lab

Our primary goal is to make progress in basic algorithmic problems in geometry.  Despite much progress in the area, for many fundamental problems, very few algorithmic techniques are available and even in cases where theoretically "efficient" algorithm are known, these algorithms scale very badly in practice. We seek to develop more general algorithmic tools that allow us to solve with a larger variety of problems  and also to find algorithms that can scale. Developing algorithms for geometric problems naturally also requires solving purely mathematical problems which can then be used to design algorithms or prove facts about them.