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