Driemel Group

We have a broad interest in algorithmic problems involving geometry. Our primary goal is to design algorithms and data structures that are both practical and have provable performance. To this end, we combine the classical worst-case analysis with approximation and randomization techniques and with realistic input assumptions. Both techniques, approximation and randomization, are useful to […]