Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming

Abstract

We give fast and efficient methods for constructing ε-nets and ε-approximations for range spaces with bounded VC-exponent. These combinatorial structures have wide applicability to geometric partitioning problems, which are often used in divide-and-conquer constructions in computational geometry algorithms. In addition, we introduce a new deterministic set approximation for range spaces with bounded VC-exponent, which we call the δ-relative ε-approximation, and we show how such approximations can be efficiently constructed in parallel. To demonstrate the utility of these constructions we show how they can be used to solve the linear programming problem in ℝd deterministically in O((log log n)d) time using linear work in the PRAM model of computation, for any fixed constant d. Our method is developed for the CRCW variant of the PRAM parallel computation model, and can be easily implemented to run in O(log n(log log n)d-1) time using linear work on an EREW PRAM.