The interface between computational and combinatorial geometry

Research output: Contribution to conferencePaperpeer-review

Abstract

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.

Original languageEnglish
Pages137-145
Number of pages9
StatePublished - 2005
EventSixteenth Annual ACM-SIAM Symposium on Discrete Algorithms - Vancouver, BC, United States
Duration: 23 Jan 200525 Jan 2005

Conference

ConferenceSixteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Country/TerritoryUnited States
CityVancouver, BC
Period23/01/0525/01/05

Fingerprint

Dive into the research topics of 'The interface between computational and combinatorial geometry'. Together they form a unique fingerprint.

Cite this