Computational Geometry and EXACUS
Coordinators
Researchers
Research Area
Our goal is the design of efficient algorithms for the solution of geometric problems arising in different application areas.
Some general subareas of interest are:
- geometry-based design and analysis of wireless networks
- robustness and exact computation
- geometric optimization and approximation algorithms
- applications in graphics and robotics
- randomized algorithms
- external memory algorithms
Sample Publications
