Derandomization in Computational Geometry

Journal of Algorithms

Volumn 20, Issue 3, 1996, Pages 545-580

  Matoušek, Jiří ^a,b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY;

RANDOMIZATION;

ALGORITHMS;

EID: 0030364522     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0027     Document Type: Article

References (121)

1. P. K. Agarwal, B. Aronov, M. Sharir, and S. Suri, Selecting distances in the plane, Algorithmica 9 (1993), 495-514.
2. N. Alon, L. Babai, and A. Itai, A fast and simple randomized algorithm for the maximal independent set problem, J. Algorithms 7 (1986), 567-583.
3. P. K. Agarwal, Partitioning arrangements of lines: I. An efficient deterministic algorithm, Discrete Comput. Geom. 5 (1990), 449-483.
4. P. K. Agarwal, Partitioning arrangements of lines: II. Applications, Discrete Comput. Geom. 5 (1990), 553-573.
5. P. K. Agarwal, Geometric partitioning and its applications, in "Computational Geometry: Papers from the DIMACS Special Year" (J. E. Goodman, R. Pollack, and W. Steiger, Eds.) Amer. Math. Soc., Providence, RI, 1991.
6. N. Alon, O. Goldreich, J. Håstad, and R. Peralta, Simple construction of almost k-wise independent random variables, Random Structures Algorithms 3 (1992), 289-304.
7. N. M. Amato, M. T. Goodrich, and E. A. Ramos, Parallel algorithms for higher dimensional convex hulls, in "Proceedings 35th Annual IEEE Symposium on Foundations of Computer Science, 1994," pp. 683-694.
8. N. Amato, M. Goodrich, and E. Ramos, Computing faces in segment and simplex arrangements, in "Proceedings 27th ACM Symposium on Theory of Computing, 1995," pp. 672-682.
9. N. Alon, D. Haussler, and E. Welzl, Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension, in "Proceedings 3rd Annual ACM Symposium Computational Geometry, 1987," pp. 331-340.
10. N. Alon and N. Megiddo, Parallel linear programming in fixed dimension almost surely in constant time, in Proceedings 31st Annual IEEE Symposium Foundations Computer Science, 1990, pp. 574-582.
11. M. Ajtai and N. Megiddo, A deterministic Poly(log log N)-time N-processor algorithm for linear programming in fixed dimension, in "Proceedings 24th Annual ACM Symposium on Theory Computing, 1992," pp. 327-338.
12. P. K. Agarwal and J. Matoušek, On range searching with semialgebraic sets, Discrete Comput. Geom. 11 (1994), 393-418.
13. P. K. Agarwal and M. Sharir, Red-blue intersection detection algorithms, with applications to motion planning and collision detection, SIAM J. Comput. 19 (1990), 297-321.
14. N. Alon and J. Spencer, "The Probabilistic Method," Wiley, New York, 1993.
15. P. K. Agarwal, M. Sharir, and S. Toledo, Applications of parametric searching in geometric optimization, in "Proceedings 3rd ACM-SIAM Symposium Discrete Algorithms, 1992," pp. 72-82.
16. P. K. Agarwal, M. Sharir, and S. Toledo, An efficient multidimensional searching technique and its applications, Technical Report CS-1993-20, Dept. Comput. Sci., Duke University, 1993.
17. J. Beck and W. Chen, "Irregularities of Distribution," Cambridge Univ. Press, Cambridge, 1987.
18. H. Brönnimann, B. Chazelle, and J. Matoušek, Product range spaces, sensitive sampling, and derandomization, in "Proceedings 34th Annual IEEE Symposium Foundations of Computer Science (FOCS 93)," pp. 400-409, 1993.
19. I. Bárány and Z. Füredi, Computing the volume is difficult, Discrete Comput. Geom. 2 (1987), 319-326.
20. H. Brönnimann and M. Goodrich, Almost optimal set covers in finite VC-dimension, in "Proceedings 10th ACM Symposium on Computational Geometry, 1994," pp. 293-302.
21. c-wise independence in NC, J. Assoc. Comput. Mach. 38(4) (1991), 1028-1046.
22. B. Berger, J. Rompel, and P. W. Shor, Efficient NC algorithms for set cover with applications to learning and geometry, in "Proceedings 30th Annual IEEE Symposium Foundations of Computer Science, 1989," Vol. 30, pp. 54-59.
23. K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Comput. Geom. 5 (1990), 99-160.
24. B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Snoeyink, Computing a face in an arrangement of line segments, SIAM J. Comput. 22 (1993), 1286-1302.
25. B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, A singly-exponential stratification scheme for real semi-algebraic varieties and its applications, in "Proceedings 16th International Colloquium Automata Language Programming," Lecture Notes in Computer Science, Vol. 372, 179-192, Springer-Verlag, Berlin, 1989.
26. B. Chazelle, H. Edelsbrunner, L. J. Guibas, and M. Sharir, Lines in space: Combinatorics, algorithms, and applications, in "Proceedings 21st Annual ACM Symposium on Theory of Computing, 1989," pp. 382-393.
27. B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, Diameter, width, closest line pair and parametric searching, Discrete Comput. Geom. 10 (1993), 183-196.
28. K. L. Clarkson, D. Eppstein, G. L. Miller, C. Sturtivant, and S.-H. Teng, Approximating center points with iterated Radon points, in "Proceeedings 9th Annual ACM Symposium Computational Geometry, 1993," pp. 91-98.
29. B. Chazelle and J. Friedman, A deterministic view of random sampling and its use in geometry, Combinatorica 10(3) (1990), 229-249.
30. B. Chazelle, Cutting hyperplanes for divide-and-conquer, Discrete Comput. Geom. 9(2) (1993), 145-158.
31. B. Chazelle, An optimal convex hull algorithm in any fixed dimension, Discrete Comput. Geom. 10 (1993), 377-409.
32. L. P. Chew, Building Voronoi diagrams for convex polygons in linear expected time, report, Department of Mathematics and Computer Science, Dartmouth College, Hanover, NH, 1985.
33. d2) time, Inform. Process. Lett. 22 (1986), 21-24.
34. K. L. Clarkson, New applications of random sampling in computational geometry, Discrete Comput. Geom. 2 (1987), 195-222.
35. K. L. Clarkson, Applications of random sampling in computational geometry, II, in "Proceedings 4th Annual ACM Symposium on Computational Geometry, 1988," pp. 1-11.
36. K. L. Clarkson, A Las Vegas algorithm for linear programming when the dimension is small, in "Proceedings 29th Annual IEEE Symposium Foundations of Computer Science, 1988," pp. 452-456.
37. K. L. Clarkson, A randomized algorithm for closest-point queries, SIAM J. Comput. 17 (1988), 830-847.
38. K. L. Clarkson, Randomized geometric algorithms, in "Computing in Euclidean Geometry" (D.-Z. Du and F. K. Hwang, Eds.), Lecture Notes Series on Computing, Vol. 1, pp. 117-162, World Scientific, Singapore, 1992.
39. B. Chazelle and J. Matoušek, Derandomizing an output-sensitive convex hull algorithm in three dimensions, Comput. Geom. Theoret. Appl. 5 (1994), 27-32.
40. B. Chazelle and J. Matoušek, On linear-time deterministic algorithms for optimization problems in fixed dimension, in "Proceedings 4th ACM-SIAM Symposium Discrete Algorithms, 1993," pp. 281-290.
41. E. Cohen and N. Megiddo, Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs, J. Assoc. Comput. Mach. 40 (1993), 791-832.
42. R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, J. Assoc. Comput. Mach. 34 (1987), 200-208.
43. K. L. Clarkson and P. W. Shor, Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental, in "Proceedings 4th Annual ACM Symposium Computational Geometry, 1988," pp. 12-17.
44. K. L. Clarkson and P. W. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989), 387-421.
45. R. Cole, J. Salowe, W. Steiger, and E. Szemerédi, An optimal-time algorithm for slope selection, SIAM J. Comput. 18 (1989), 792-810.
46. R. Cole, M. Sharir, and C. Yap, On k-hulls and related problems, SIAM J. Comput. 16(1) (1987), 61-67.
47. B. Chazelle and E. Welzl, Quasi-optimal range searching in spaces of finite VC-dimension, Discrete Comput. Geom. 4 (1989), 467-489.
48. M. Dyer, A. Frieze, and R. Kannan, A random polynomial time algorithm for approximating the volume of convex bodies, J. Assoc. Comput. Mach. 38 (1991), 1-17.
49. M. B. Dillencourt, D. M. Mount, and N. S. Netanyahu, A randomized algorithm for slope selection, Internat. J. Comput. Geom. Appl. 2 (1992), 1-27.
50. M. E. Dyer, On a multidimensional search technique and its application to the Euclidean one-center problem, SIAM J. Comput. 15 (1986), 725-738.
51. M. Dyer, A class of convex programs with applications to computational geometry, in "Proceedings 8th Annual ACM Symposium Computational Goemetry, 1992," pp. 9-15.
52. M. Dyer, A parallel algorithm for linear programming in fixed dimension, in "Proceedings 11th ACM Symposium on Computational Geometry, 1995," pp. 345-349.
53. H. Edelsbrunner, "Algorithms in Combinatorial Geometry," EATCS Monographs on Theoretical Computer Science, Vol. 10, Springer-Verlag, Heidelberg, 1987.
54. G. Even, O. Goldreich, M. Luby, N. Nison, and B. Veliković, Approximations of general independent distributions, in "Proceedings 24th ACM Symposium on Theory of Computing, 1992," pp. 10-16.
55. H. Edelsbrunner, L. Guibas, and M. Sharir, The complexity of many cells in arrangements of planes and related problems, Discrete Comput. Geom. 5 (1990), 197-216.
56. G. Elekés, A geometric inequality and the complexity of computing the volume, Discrete Comput. Geom. 1 (1986), 289-292.
57. D. Eppstein, G. L. Miller, and S.-H. Teng, A deterministic linear time algorithm for geometric separators and its applications, in "Proceedings 9th Annual Symposium Computational Geometry, 1993," pp. 99-108.
58. M. Eisner and D. Severance, Mathematical techniques for efficient record segmentation in large shared database, J. Assoc. Comput. Mach. 23 (1976), 619-635.
59. L. J. Guibas, D. E. Knuth, and M. Sharir, Randomized incremental construction of Delaunay and Voronoi diagrams, Algorithmica 7 (1992), 381-413.
60. M. T. Goodrich, Geometric partitioning made easier, even in parallel, in "Proceedings 9th Annual ACM Symposium Computational Geometry, 1993," pp. 73-82.
61. M. Goodrich, Relative ε-approximations and parallel linear programming, manuscript, 1995.
62. L. Guibas and M. Sharir, Combinatorics and algorithms of arrangements, in "New Trends in Discrete and Computational Geometry," (J. Pach, Ed.), Algorithms and Combinatorics, Vol. 10, pp. 9-36, Springer-Verlag, Berlin, 1993.
63. D. Gusfield, Parametric combinatorial computing and a problem of program module distribution, J. Assoc. Comput. Mach. 30 (1983), 551-563.
64. D. Haussler and E. Welzl, Epsilon-nets and simplex range queries, Discrete Comput. Geom. 2 (1987), 127-151.
65. A. Joffe, On a set of almost deterministic k-independent random variables, Ann. Probab. 2 (1974), 161-162.
66. G. Kalai, A subexponential randomized simplex algorithm, in "Proceedings 24th Annual ACM Symposium on Theory of Computing 1992," pp. 475-482.
67. R. Karp, An introduction to randomized algorithms, Discrete Appl. Math. 34 (1991), 165-201.
68. D. Koller and N. Megiddo, Constructing small sample spaces satisfying given constraints, in "Proceedings 25th ACM Symposium on Theory of Computing, 1993," pp. 268-277.
69. J. Komlós, J. Pach, and G. Woeginger, Almost tight bounds for ε-nets, Discrete Comput. Geom. 7 (1992), 163-173.
70. H. Karloff and P. Raghavan, Randomized algorithms and pseudorandom numbers, J. Assoc. Comput. Mach. 40(3) (1993), 454-476.
71. M. J. Katz and M. Sharir, An expander-based approach to geometric optimization, in "Proceedings 9th Annual ACM Symposium Computational Geometry, 1993," pp. 198-207.
72. R. Karp and M. Wigderson, A fast parallel algorithm for the maximum independent set problem, J. Assoc. Comput. Mach. 32 (1985), 762-773.
73. d, Discrete Comput. Geom. 11 (1994), 433-452.
74. L. Lovász and M. Simonovits, On the randomized complexity of volume and diameter, in "Proceedings 33rd Annual IEEE Symposium on Foundations of Computer Science, 1992," pp. 482-492.
75. M. Luby, Removing randomness in parallel computation without processor penalty, in "Proceedings 29th IEEE Symposium on Foundations of Computer Science, 1988," pp. 162-173.
76. M. Luby and B. Veliković, On deterministic approximation of dnf, in "Proceedings 23rd ACM Symposium on Theory of Computing, 1991," pp. 430-438.
77. J. Matoušek, Construction of ε-nets, Discrete Comput. Geom. 5 (1990), 427-448.
78. J. Matoušek, Approximations and optimal geometric divide-and-conquer, in "Proceedings 23rd Annual ACM Symposium Theory of Computing, 1991," pp. 505-511. Also J. Comput. System Sci. 50 (1995), 203-208.
79. J. Matoušek, Approximations and optimal geometric divide-and-conquer, in "Proceedings 23rd Annual ACM Symposium Theory of Computing, 1991," pp. 505-511. Also J. Comput. System Sci. 50 (1995), 203-208.
80. J. Matoušek, Cutting hyperplane arrangements, Discrete Comput. Geom. 6 (1991), 385-406.
81. J. Matoušek, Randomized optimal algorithm for slope selection, Inform. Process. Lett. 39 (1991), 183-187.
82. J. Matoušek, Reporting points in halfspaces, Comput. Geom. Theory Appl. 2(3) (1992), 169-186.
83. J. Matoušek, Efficient partition trees, Discrete Comput. Geom. 8 (1992), 315-334.
84. J. Matoušek, Geometric range searching, Technical Report B-93-09, Fachbereich Mathematik und Informatik, Free University Berlin, 1993. Also ACM Comput. Surveys 26 (1995), 421-461.
85. J. Matoušek, Geometric range searching, Technical Report B-93-09, Fachbereich Mathematik und Informatik, Free University Berlin, 1993. Also ACM Comput. Surveys 26 (1995), 421-461.
86. N. Megiddo, Combinatorial optimization with rational objective functions, Math. Oper. Res. 4 (1979), 414-424.
87. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. Assoc. Comput. Mach. 30 (1983), 852-865.
88. N. Megiddo, Linear programming in linear time when the dimension is fixed, J. Assoc. Comput. Mach. 31 (1984), 114-127.
89. K. Mehlhorn, "Multi-dimensional Searching and Computational Geometry," Vol. 3, Data Structures and Algorithms, Springer-Verlag, Heidelberg, 1984.
90. R. Motwani, J. Naor, and M. Naor, The probabilistic method yields deterministic parallel algorithms, in "Proceedings 30th Annual IEEE Symposium on Foundations of Computer Science, 1989," pp. 8-13.
91. J. Matoušek and O. Schwarzkopf, A deterministic algorithm for the three-dimensional diameter problem, in "Proceedings 25th Annual ACM Symposium on Theory, Computing, 1993," pp. 478-484.
92. J. Matoušek, R. Seidel, and E. Welzl, How to net a lot with little: small ε-nets for disks and halfspaces, in "Proceedings 6th Annual ACM Symposium on Computational Geometry, 1990," pp. 16-22.
93. J. Matoušek, M. Sharir, and E. Welzl, A subexponential bound for linear programming, in "Proceedings 8th Annual ACM Symposium on Computational Geometry, 1992," pp. 1-8. Also to appear in Algorithmica.
94. J. Matoušek, M. Sharir, and E. Welzl, A subexponential bound for linear programming, in "Proceedings 8th Annual ACM Symposium on Computational Geometry, 1992," pp. 1-8. Also to appear in Algorithmica.
95. K. Mehlhorn, M. Sharir, and E. Welzl, Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection, Comput. Geom. Theory Appl. 3 (1993), 235-246.
96. K. Mulmuley, A fast planar partition algorithm, I, in "Proceedings 29th Annual IEEE Symposium on Foundations of Computer Science 1988," pp. 580-589.
97. K. Mulmuley, A fast planar partition algorithm, II, J. Assoc. Comput. Mach. 38 (1991), 74-103.
98. K. Mulmuley, On levels in arrangements and Voronoi diagrams, Discrete Comput. Geom. 6 (1991), 307-338.
99. K. Mulmuley, Randomized multidimensional search trees: Dynamic sampling, in "Proceedings 7th Annual ACM Symposium Computational Geometry, 1991," pp. 121-131.
100. K. Mulmuley, Randomized geometric algorithms and pseudo-random generators, in "Proceedings 33rd Annual IEEE Symposium on Foundations of Computer Science, 1992," pp. 90-100.
101. K. Mulmuley, "Computational Geometry: An Introduction Through Randomized Algorithms," Prentice-Hall, New York, 1993.
102. J. Matoušek, E. Welzl, and L. Wernisch, Discrepancy and ε-approximations for bounded VC-dimension, Combinatorial 13 (1993), 455-466.
103. J. Naor and M. Naor, Small-bias probability spaces: Efficient construction and applications, in "Proceedings 22nd ACM Symposium on Theory of Computing, 1990," pp. 213-223.
104. C. H. Norton, S. A. Plotkin, and É. Tardos, Using separation algorithms in fixed dimensions, J. Algorithms 13 (1992), 79-98.
105. N. Nison and D. Zuckerman, More deterministic simulations in logspace, in "Proceedings 25th ACM Symposium on Theory of Computing, 1993," pp. 235-244.
106. J. Pach (Ed.), "New Trends in Discrete and Computational Geometry," Vol. 10, Algorithms and Combinatorics, Springer-Verlag, Berlin, 1993.
107. F. P. Preparata and M. I. Shamos, "Computational Geometry: An Introduction," Springer-Verlag, New York, 1985.
108. M. O. Rabin, Probabilistic algorithms, in "Algorithms and Complexity" (J. F. Traub, Ed.), pp. 21-30, Academic Press, New York, 1976.
109. P. Raghavan, Probabilistic construction of deterministic algorithms: approximating packing integer programs, J. Comput. System Sci. 37 (1988), 130-143.
110. 3, Technical Report UIUCDS-R-94-1851, Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1994.
111. J. H. Reif and S. Sen, Optimal randomized parallel algorithms for computational geometry, Algorithmica 7(1) (1992), 91-117.
112. R. Seidel, A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Comput. Geom. Theory Appl. 1 (1991), 51-64.
113. R. Seidel, Small-dimensional linear programming and convex hulls made easy, Discrete Comput. Geom. 6 (1991), 423-434.
114. R. Seidel, Backwards analysis of randomized geometric algorithms, in "New Trends in Discrete and Computational Geometry," (J. Pach, Ed.), Vol. 10, Algorithms and Combinatorics, pp. 37-68, Springer-Verlag, Berlin, 1993.
115. J. Spencer, "Ten lectures on the probabilistic method," CBMS-NSF, SIAM, Philadelphia, 1987.
116. V. N. Vapnik and A. Ya. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 16 (1971), 264-280.
117. U. Vishkin, Deterministic sampling: A new technique for fast pattern matching, in "Proceedings 22nd ACM Symposium on Theory of Computing, 1990."
118. E. Welzl, Partition trees for triangle counting and other range searching problems, in "Proceedings 4th Annual ACM Symposium on Computational Geometry, 1988," pp. 23-33.
119. D. E. Willard, Polygon retrieval, SIAM J. Comput. 11 (1982), 149-165.
120. A. Wigderson and D. Zuckerman, Expanders that beat the eigenvalue bound: Explicit construction and applications, in "Proceedings 25th ACM Symposium on Theory of Computing, 1993," pp. 245-251.
121. A. C. Yao and F. F. Yao, A general approach to D-dimensional geometric queries, in "Proceedings 17th Annual ACM Symposium on Theory of Computing, 1985," pp. 163-68.