Charles Explorer logo
🇬🇧

Derandomization in computational geometry

Publication at Faculty of Mathematics and Physics |
2000

Abstract

We survey techniques for replacing randomized algorithms in computational geometry by deterministic ones with a similar asymptotic running time.