Derandomization in Computational Geometry

We survey techniques for replacing randomized algorithms in computational geometry by deterministic ones with a similar asymptotic running time.

[1]  Jirí Matousek,et al.  Discrepancy and approximations for bounded VC-dimension , 1993, Comb..

[2]  Bonnie Berger,et al.  Simulating (logcn)-wise independence in NC , 1991, JACM.

[3]  Nimrod Megiddo,et al.  Combinatorial optimization with rational objective functions , 1978, Math. Oper. Res..

[4]  Nancy M. Amato,et al.  Computing faces in segment and simplex arrangements , 1995, STOC '95.

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

[6]  Ketan Mulmuley.  A Fast Planar Partition Algorithm, I , 1990, J. Symb. Comput..

[7]  Richard Cole,et al.  On k-hulls and related problems , 1984, STOC '84.

[8]  Jirí Matousek,et al.  Reporting Points in Halfspaces , 1992, Comput. Geom..

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

[10]  Moni Naor,et al.  The Probabilistic Method Yields Deterministic Parallel Algorithms , 1994, J. Comput. Syst. Sci..

[11]  Noga Alon,et al.  Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension , 1987, SCG '87.

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

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

[14]  Joe W. Harris,et al.  Algebraic Geometry: A First Course , 1995 .

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

[16]  Michael Luby.  Removing randomness in parallel computation without a processor penalty , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[17]  Ketan Mulmuley,et al.  A fast planar partition algorithm, II , 1989, JACM.

[18]  Éva Tardos,et al.  Using separation algorithms in fixed dimension , 1990, SODA '90.

[19]  Otfried Cheong.  Ray Shooting in Convex Polytopes , 1992, Symposium on Computational Geometry.

[20]  David R. Karger,et al.  (De)randomized Construction of Small Sample Spaces in NC , 1997, J. Comput. Syst. Sci..

[21]  R. Seidel.  Backwards Analysis of Randomized Geometric Algorithms , 1993 .

[22]  Jirí Matousek,et al.  Geometric range searching , 1994, CSUR.

[23]  Nimrod Megiddo,et al.  Constructing small sample spaces satisfying given constraints , 1993, SIAM J. Discret. Math..

[24]  Leonidas J. Guibas,et al.  Computing a face in an arrangement of line segments , 1991, SODA '91.

[25]  Michael T. Goodrich,et al.  Almost optimal set covers in finite VC-dimension , 1995, Discret. Comput. Geom..

[26]  Richard M. Karp,et al.  An introduction to randomized algorithms , 1991, Discret. Appl. Math..

[27]  Nimrod Megiddo.  Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..

[28]  Pankaj K. Agarwal.  Geometric Partitioning and its Applications , 1990, Discrete and Computational Geometry.

[29]  Bernard Chazelle,et al.  Quasi-optimal range searching in spaces of finite VC-dimension , 1989, Discret. Comput. Geom..

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

[31]  Edgar A. Ramos.  Construction of 1-d lower envelopes and applications , 1997, SCG '97.

[32]  L. Chew.  Building Voronoi Diagrams for Convex Polygons in Linear Expected Time , 1990 .

[33]  Noga Alon,et al.  Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.

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

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

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

[37]  David Eppstein,et al.  Approximating center points with iterative Radon points , 1996, Int. J. Comput. Geom. Appl..

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

[39]  Aravind Srinivasan,et al.  Chernoff-Hoeffding bounds for applications with limited independence , 1995, SODA '93.

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

[41]  Ketan Mulmuley,et al.  A fast planar partition algorithm, II , 1991, SCG '89.

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

[43]  Bernard Chazelle,et al.  Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions , 1995, Comput. Geom..

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

[45]  MatoušekJiří.  Geometric range searching , 1994 .

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

[47]  Timothy M. Chan.  Fixed-dimensional linear programming queries made easy , 1996, SCG '96.

[48]  Dan Gusfield,et al.  Parametric Combinatorial Computing and a Problem of Program Module Distribution , 1983, JACM.

[49]  Jirí Matousek,et al.  A deterministic algorithm for the three-dimensional diameter problem , 1993, STOC '93.

[50]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computation , 1992, Comb..

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

[52]  Micha Sharir,et al.  An Expander-Based Approach to Geometric Optimization , 1997, SIAM J. Comput..

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

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

[55]  Prabhakar Raghavan,et al.  Randomized algorithms and pseudorandom numbers , 1993, JACM.

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

[57]  Noga Alon,et al.  Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[58]  Raimund Seidel,et al.  Constructing higher-dimensional convex hulls at logarithmic cost per face , 1986, STOC '86.

[59]  Micha Sharir,et al.  Optimal Slope Selection Via Expanders , 1993, CCCG.

[60]  David Eppstein,et al.  Approximating center points with iterated radon points , 1993, SCG '93.

[61]  Martin E. Dyer,et al.  A class of convex programs with applications to computational geometry , 1992, SCG '92.

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

[63]  Jirí Matousek.  Linear Optimization Queries , 1993, J. Algorithms.

[64]  Jirí Matousek,et al.  A Deterministic Algorithm for the Three-dimensional Diameter Problem , 1996, Comput. Geom..

[65]  William L. Steiger,et al.  Algorithms for ham-sandwich cuts , 1994, CCCG.

[66]  Ketan Mulmuley,et al.  On levels in arrangements and voronoi diagrams , 1991, Discret. Comput. Geom..

[67]  Andrew Chi-Chih Yao,et al.  A general approach to d-dimensional geometric queries , 1985, STOC '85.

[68]  Nimrod Megiddo,et al.  A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimensions , 1996, SIAM J. Comput..

[69]  Leonidas J. Guibas,et al.  Lines in space - combinatorics, algorithms and applications , 1989, Symposium on the Theory of Computing.

[70]  Nimrod Megiddo,et al.  Constructing Small Sample Spaces Satisfying Given Constraints , 1994, SIAM J. Discret. Math..

[71]  Otfried Cheong,et al.  On ray shooting in convex polytopes , 1993, Discret. Comput. Geom..

[72]  Dennis G. Severance,et al.  Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases , 1976, JACM.

[73]  Jirí Matousek,et al.  Computing many faces in arrangements of lines and segments , 1994, SCG '94.

[74]  Jirí Matousek,et al.  Cutting hyperplane arrangements , 1990, SCG '90.

[75]  Marco Pellegrini,et al.  On point location and motion planning among simplices , 1994, STOC '94.

[76]  Richard M. Karp,et al.  A fast parallel algorithm for the maximal independent set problem , 1985, JACM.

[77]  Bernard Chazelle,et al.  Optimal Slope Selection Via Cuttings , 1994, CCCG.

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

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

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

[81]  Bonnie Berger,et al.  Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry , 1994, J. Comput. Syst. Sci..

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

[83]  Jirí Matousek,et al.  How to net a lot with little: small ε-nets for disks and halfspaces , 1990, SCG '90.

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

[85]  Jirí Matousek,et al.  Discrepancy and approximations for bounded VC-dimension , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[86]  Martin E. Dyer,et al.  A parallel algorithm for linear programming in fixed dimension , 1995, SCG '95.

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

[88]  Kenneth L. Clarkson,et al.  Las Vegas algorithms for linear and integer programming when the dimension is small , 1995, JACM.

[89]  Leonidas J. Guibas,et al.  Combinatorics and Algorithms of Arrangements , 1993 .

[90]  Raimund Seidel,et al.  A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons , 1991, Comput. Geom..

[91]  Moni Naor,et al.  Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..

[92]  Mark de Berg,et al.  On lazy randomized incremental construction , 1994, STOC '94.

[93]  Micha Sharir,et al.  Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection , 1990, SIAM J. Comput..

[94]  John Rompel,et al.  Techniques for computing with low-independence randomness , 1990 .

[95]  Nancy M. Amato,et al.  Parallel algorithms for higher-dimensional convex hulls , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[96]  Y. Mansour,et al.  On construction of k-wise independent random variables , 1994, STOC '94.

[97]  Raimund Seidel,et al.  Small-dimensional linear programming and convex hulls made easy , 1991, Discret. Comput. Geom..

[98]  Edith Cohen,et al.  Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs , 1989, STOC '89.

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

[100]  Noam Nisan,et al.  Approximations of general independent distributions , 1992, STOC '92.

[101]  Yishay Mansour,et al.  On construction ofk-wise independent random variables , 1997, Comb..

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

[103]  Leonidas J. Guibas,et al.  Diameter, width, closest line pair, and parametric searching , 1993, Discret. Comput. Geom..

[104]  Edgar A. Ramos.  An algorithm for intersecting equal radius balls in R\u3\d , 1994 .

[105]  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).

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

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

[108]  Avi Wigderson,et al.  Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications , 1999, Comb..

[109]  Bernard Chazelle,et al.  On linear-time deterministic algorithms for optimization problems in fixed dimension , 1996, SODA '93.

[110]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[111]  Ketan Mulmuley,et al.  Computational geometry : an introduction through randomized algorithms , 1993 .

[112]  Edgar A. Ramos,et al.  Solving Some Discrepancy Problems in NC , 1997, Algorithmica.

[113]  János Komlós,et al.  Almost tight bounds forɛ-Nets , 1992, Discret. Comput. Geom..

[114]  Michael Luby.  Removing Randomness in Parallel Computation without a Processor Penalty , 1993, J. Comput. Syst. Sci..

[115]  Bernard Chazelle,et al.  A deterministic view of random sampling and its use in geometry , 1990, Comb..

[116]  Jirí Matousek,et al.  Computing Many Faces in Arrangements of Lines and Segments , 1998, SIAM J. Comput..

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

[118]  Ketan Mulmuley.  Randomized geometric algorithms and pseudo-random generators , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[119]  Micha Sharir,et al.  Selecting distances in the plane , 1990, SCG '90.

[120]  Paul Erdös,et al.  On a Combinatorial Game , 1973, J. Comb. Theory A.

[121]  Michael T. Goodrich,et al.  Fixed-dimensional parallel linear programming via relative ε-approximations , 1996, SODA '96.

[122]  Kenneth L. Clarkson,et al.  RANDOMIZED GEOMETRIC ALGORITHMS , 1992 .

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

[124]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[125]  Ivan J. Balaban,et al.  An optimal algorithm for finding segments intersections , 1995, SCG '95.

[126]  Edith Cohen,et al.  Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs , 1993, JACM.

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

[128]  Richard Cole,et al.  On k-Hulls and Related Problems , 1987, SIAM J. Comput..

[129]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.