The combination of divide-and-conquer and random sampling has proven very effective in the design of fast geometric algorithms. A flurry of efficient probabilistic algorithms have been recently discovered, based on this happy marriage. We show that all those algorithms can be derandomized with only polynomial overhead. In the process we establish results of independent interest concerning the covering of hypergraphs and we improve on various probabilistic bounds in geometric complexity. For example, given n hyperplanes in d-space and any integer r large enough, we show how to compute, in polynomial time, a simplicial packing of size O(rd) which covers d-space, each of whose simplices intersects O(n/r) hyperplanes.
|Original language||English (US)|
|Number of pages||21|
|State||Published - Sep 1 1990|
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Computational Mathematics