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.
|Number of pages||9|
|State||Published - 2005|
|Event||Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms - Vancouver, BC, United States|
Duration: 23 Jan 2005 → 25 Jan 2005
|Conference||Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms|
|Period||23/01/05 → 25/01/05|