Randomized Algorithms in Computational Geometry

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

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

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

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

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

[6]  Jirí Matousek,et al.  Ray shooting and parametric search , 1992, STOC '92.

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

[8]  Jirí Matousek,et al.  Linear optimization queries , 1992, SCG '92.

[9]  Olivier Devillers.  Randomization yields simple O(n log* n) algorithms for difficult Omega(n) problems , 1992, Int. J. Comput. Geom. Appl..

[10]  Ketan Mulmuley.  Randomized multidimensional search trees: further results in dynamic sampling , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[11]  Bernard Chazelle,et al.  An optimal convex hull algorithm and new results on cuttings , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[13]  O. Schwarzkopf.  Dynamic maintenance of geometric structures made easy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[14]  Ketan Mulmuley.  Randomized multidimensional search trees: lazy balancing and dynamic shuffling , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[15]  Olivier Devillers,et al.  Fully Dynamic Delaunay Triangulation in Logarithmic Expected Time Per Operation , 1991, Comput. Geom..

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

[17]  Franz Aurenhammer,et al.  A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams , 1991, SCG '91.

[18]  Ketan Mulmuley,et al.  Dynamic point location in arrangements of hyperplanes , 1991, SCG '91.

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

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

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

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

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

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

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

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

[27]  Kurt Mehlhorn,et al.  On the construction of abstract voronoi diagrams , 1990, STACS.

[28]  William Pugh,et al.  Skip lists: a probabilistic alternative to balanced trees , 1989, CACM.

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

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

[31]  Ketan Mulmuley,et al.  An efficient algorithm for hidden surface removal , 1989, SIGGRAPH.

[32]  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.

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

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

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

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