Improved algorithms in geometric optimization via expanders

We incorporate into our expander-based technique for solving problems in geometric optimization, as developed in Katz and Sharir (1993), a technique which is in some sense equivalent to (though much more flexible than) Cole's technique for accelerating parametric searching (1987). This enables us to obtain, in some cases, deterministic algorithms that are asymptotically faster by a logarithmic factor than the best previously known algorithms (which are mostly based on parametric searching). We exemplify the enhanced technique on two problems, the planar distance selection problem and the planar two-line center problem. To obtain our more efficient solutions, we also develop some auxiliary results concerning batched range searching where the ranges are congruent discs or annuli. For example, we show that it is possible to compute deterministically a compact representation of the set of all point-disc containments among a set of n congruent discs and a set of m points in the plane, in time O((m/sup 2/3/n/sup 2/3/+m+n) log n), slightly better than what was previously known. We believe these results are of independent interest.<<ETX>>

[1]  Michael T. Goodrich.  Geometric partitioning made easier, even in parallel , 1993, SCG '93.

[2]  Nimrod Megiddo,et al.  Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[3]  Sivan Toledo,et al.  Applications of parametric searching in geometric optimization , 1992, SODA '92.

[4]  Micha Sharir,et al.  Computing the Smallest K-enclosing Circle and Related Problems , 1994, Comput. Geom..

[5]  Micha Sharir,et al.  Planar geometric location problems and maintaining the width of a planar set , 1991, SODA '91.

[6]  Leonidas J. Guibas,et al.  Diameter, width, closest line pair, and parametric searching , 1992, SCG '92.

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

[8]  Alexander Lubotzky,et al.  Explicit expanders and the Ramanujan conjectures , 1986, STOC '86.

[9]  Jirí Matousek,et al.  Ray Shooting and Parametric Search , 1993, SIAM J. Comput..

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

[11]  Jirí Matousek,et al.  Randomized Optimal Algorithm for Slope Selection , 1991, Inf. Process. Lett..

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

[13]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[14]  Jirí Matousek,et al.  On Enclosing k Points by a Circle , 1995, Inf. Process. Lett..

[15]  Richard Cole,et al.  Slowing down sorting networks to obtain faster sorting algorithms , 2015, JACM.

[16]  Endre Szemerédi,et al.  An Optimal-Time Algorithm for Slope Selection , 1989, SIAM J. Comput..

[17]  Nimrod Megiddo,et al.  A deterministic poly(log log N)-time N-processor algorithm for linear programming in fixed dimension , 1992, STOC '92.

[18]  Endre Szemerédi,et al.  Optimal Slope Selection , 1988, ICALP.

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

[20]  Bernard Chazelle,et al.  Cutting hyperplanes for divide-and-conquer , 1993, Discret. Comput. Geom..

[21]  Micha Sharir,et al.  A near-linear algorithm for the planar segment-center problem , 1994, SODA '94.

[22]  Sivan Toledo,et al.  Extremal polygon containment problems , 1991, SCG '91.

[23]  David M. Mount,et al.  A randomized algorithm for slope selection , 1992, Int. J. Comput. Geom. Appl..

[24]  Leonidas J. Guibas,et al.  Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..

[25]  Jirí Matousek,et al.  On range searching with semialgebraic sets , 1992, Discret. Comput. Geom..

[26]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[27]  Micha Sharir,et al.  An expander-based approach to geometric optimization , 1993, SCG '93.