The interface between computational and combinatorial geometry
Micha Sharir · Symposium on Discrete Algorithms · 2005
We illustrate the rich interface between computational and combinatorial geometry by a series of examples, including k-sets, randomized incremental algorithms, random sampling and partitioning, and analysis of geometric arrangements.