Cutting hyperplanes for divide-and-conquer

Givenn hyperplanes inEd, a (1/r)-cutting is a collection of simplices with disjoint interiors, which together coverEd and such that the interior of each simplex intersects at mostn/r hyperplanes. We present a deterministic algorithm for computing a (1/r)-cutting ofO(rd) size inO(nrd−1) time. If we require the incidences between the hyperplanes and the simplices of the cutting to be provided, then the algorithm is optimal. Our method is based on a hierarchical construction of cuttings, which also provides a simple optimal data structure for locating a point in an arrangement of hyperplanes. We mention several other applications of our result, e.g., counting segment intersections, Hopcroft's line/point incidence problem, linear programming in fixed dimension.

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

[2]  Jirí Matousek,et al.  Range searching with efficient hierarchical cuttings , 1992, SCG '92.

[3]  M. H. Overmars,et al.  Counting and reporting intersections in arrangements , 1989 .

[4]  Jirí Matousek,et al.  Efficient partition trees , 1991, SCG '91.

[5]  Jirí Matousek.  Construction of ɛ-nets , 1990, Discret. Comput. Geom..

[6]  David Haussler,et al.  Epsilon-nets and simplex range queries , 1986, SCG '86.

[7]  Jirí Matousek.  Cutting hyperplane arrangements , 1991, Discret. Comput. Geom..

[8]  Chee-Keng Yap,et al.  A geometric consistency theorem for a symbolic perturbation scheme , 1988, SCG '88.

[9]  Raimund Seidel,et al.  Linear programming and convex hulls made easy , 1990, SCG '90.

[10]  Pankaj K. Agarwal,et al.  Partitioning arrangements of lines II: Applications , 2011, Discret. Comput. Geom..

[11]  Kenneth L. Clarkson,et al.  A Las Vegas algorithm for linear programming when the dimension is small , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[12]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1989, Discret. Comput. Geom..

[13]  Kenneth L. Clarkson,et al.  Linear Programming in O(n * (3_d)_2) Time , 1986, Information Processing Letters.

[14]  Leonidas J. Guibas,et al.  A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications , 1991, Theor. Comput. Sci..

[15]  Jirí Matousek,et al.  Approximations and optimal geometric divide-and-conquer , 1991, STOC '91.

[16]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[17]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[18]  Nimrod Megiddo,et al.  Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.

[19]  Pankaj K. Agarwal.  Partitioning arrangements of lines I: An efficient deterministic algorithm , 1990, Discret. Comput. Geom..

[20]  Bernard Chazelle,et al.  A deterministic view of random sampling and its use in geometry , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

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

[23]  Bernard Chazelle,et al.  Point Location Among Hyperplanes and Unidirectional Ray-shooting , 1994, Comput. Geom..

[24]  Leonidas J. Guibas,et al.  Implicitly representing arrangements of lines or segments , 2011, SCG '88.

[25]  Martin E. Dyer,et al.  Linear Time Algorithms for Two- and Three-Variable Linear Programs , 1984, SIAM J. Comput..

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

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

[28]  Bernard Chazelle,et al.  An optimal convex hull algorithm in any fixed dimension , 1993, Discret. Comput. Geom..

[29]  Jirí Matousek.  Cutting hyperplane arrangements , 1990, SCG '90.