A deterministic view of random sampling and its use in geometry

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, givenn hyperplanes ind-space and any integerr large enough, we show how to compute, in polynomial time, a simplicial packing of sizeO(rd) which coversd-space, each of whose simplices intersectsO(n/r) hyperplanes.

[1]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[2]  Micha Sharir,et al.  Red-Blue intersection detection algorithms, with applications to motion planning and collision detection , 1990, SCG '88.

[3]  Raimund Seidel,et al.  Constructing Arrangements of Lines and Hyperplanes with Applications , 1986, SIAM J. Comput..

[4]  Prabhakar Raghavan,et al.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[5]  Kenneth L. Clarkson,et al.  A fast Las Vegas algorithm for triangulating a simple polygon , 1988, SCG '88.

[6]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[7]  Kenneth L. Clarkson,et al.  Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental , 1988, SCG '88.

[8]  Kenneth L. Clarkson,et al.  New applications of random sampling in computational geometry , 1987, Discret. Comput. Geom..

[9]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[10]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[11]  Kenneth L. Clarkson,et al.  A Randomized Algorithm for Closest-Point Queries , 1988, SIAM J. Comput..

[12]  Leonidas J. Guibas,et al.  The complexity of many faces in arrangements of lines of segments , 1988, SCG '88.

[13]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[14]  A. Joffe.  On a Set of Almost Deterministic $k$-Independent Random Variables , 1974 .

[15]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[16]  Emo Welzl,et al.  Partition trees for triangle counting and other range searching problems , 1988, SCG '88.

[17]  Robert E. Tarjan,et al.  An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon , 1988, SIAM J. Comput..

[18]  J. Spencer.  Probabilistic Methods in Combinatorics , 1974 .

[19]  Joel H. Spencer,et al.  Explicit codes with low covering radius , 1988, IEEE Trans. Inf. Theory.

[20]  Norbert Sauer,et al.  On the Density of Families of Sets , 1972, J. Comb. Theory A.

[21]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .