Randomized geometric algorithms and pseudo-random generators

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1992-October, Issue , 1992, Pages 90-100

  Mulmuley, Ketan ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONSTANT FACTORS; CONVEX POLYTOPES; GEOMETRIC ALGORITHM; GEOMETRIC PROBLEMS; HIGHER-DIMENSIONAL; LINEAR CONGRUENTIAL GENERATOR; PSEUDORANDOM GENERATORS; RANDOMIZED INCREMENTAL ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 52749092341     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1992.267815     Document Type: Conference Paper

References (16)

1. Boissonnat J., Teillaud M., On the randomized construction of the Delauney tree, Technical Report 1140, INRIA (France), 1989.
2. Chazelle B., Edelsbrunner H., An optimal algorithm for intersecting line segments in the plane, Proceedings of the FOCS, 88.
3. K. Clarkson, A Las Vegas algorithm for linear programming when the dimension is small, FOCS 88.
4. K. Clarkson, P. Shor, Applications of random sampling in computational geometry, II, Disc. and Comp. Geo. 4:387-421 (1989).
5. L. Guibas, D. Knuth, M. Sharir, Randomized incremental construction of Delauney and Voronoi diagrams, Springer LNCS (1990), pp. 414-431.
6. H. Karloff, P. Raghavan, Randomized algorithms and pseudorandom numbers, STOC 88.
7. N. Megiddo, Linear programming in linear time when the dimension is fixed, J. ACM 34, 1981, 114-121.
8. K. Mehlhorn, S. Meiser, C. O'Dunlaing, On the construction of abstract Voronoi diagrams, Disc. Comp. Geom., 6:211-224, 1991.
9. K. Mulmuley, A fast planar partition algorithm, I, Proc. of the 29th FOCS, 1988, pp.580-589.
10. K. Mulmuley, "An efficient algorithm for hidden surface removal", Proceedings of the ACM SIGGRAPH, Computer Graphics, Vol.23, Number 3, 1989.
11. K. Mulmuley, "On levels in arrangements and Voronoi diagrams", Disc, and Comp. Geom., vol. 6, number 4, 1991.
12. K. Mulmuley, Randomized Multidimensional Search trees: lazy balancing and dynamic shuffling, FOCS 1991.
13. J. Reif, S. Sen, Optimal parallel randomized algorithms for 3-D convex hulls and related problems, manuscript, preliminary version appears as "Polling: a new randomized sampling technique for computational geometry", STOC 89.
14. Schwarzkopf O. Dynamic maintenance of geometric structures made easy, FOCS, 1991.
15. Seidel R., Linear programming and convex hulls made easy, Sixth Ann. ACM Symp. Computational Geometry, pages 211-215, 1990.
16. Seidel R., A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Technical Report B 90-07, Freie Univer-sitdt Berlin, October 1990.