Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alexander, R. Geometric methods in the study of irregularities of distribution, Combinatorica 10 (1990), 115–136.
Alon, N., Babai, L., Itai, A. A fast and simple randomized algorithm for the maximal independent set problem, J. Alg. 7 (1986), 567–583.
Alon, N., Bárány, I., Füredi, Z., Kleitman, D. Point selections and weak ɛ-nets for convex hulls, manuscript, 1991.
Alon, N., Goldreich, O., Hastad, J., Peralta, R. Simple constructions of almost κ-wise independent random variables, Proc. 31st Ann. IEEE Symp. Foundat. Comput. Sci. (1990), 544–553.
Beck, J. An algorithmic approach to the Lovász local lemma. I. Random Structures & Algorithms 2 (1991), 343–365.
Beck, J., Chen, W.W.L. Irregularities of distribution, Cambridge Tracts in Mathematics, 89, Cambridge Univ. Press, Cambridge, 1987.
Berger, B., Rompel, J. Simulating (logn)c-wise independence in NC, J. ACM 38 (1991), 1028–1046.
Berger, B., Rompel, J., Shor, P. Efficient NC algorithms for set cover with applications to learning and geometry, Proc. 30th Ann. IEEE Symp. Foundat. Comput. Sci., (1989), 54–59.
Boissonnat, J.D., Devillers, O., Schott, R., Teillaud, M., Yvinec, M. Applications of random sampling to on-line algorithms in computational geometry, Disc. Comput. Geom., 8 (1992), 51–71.
Boissonnat, J.D., Teillaud, M. On the randomized construction of the Delaunay tree, Theoretical Comput. Sci., to appear. Tech Rep. INRIA 1140.
Brönnimann, H., Chazelle, B., Matoušek, J. Product range spaces, sensitive sampling, and derandomization, Proc. 34th Annual IEEE Symposium on Foundations of Computer Science, Nov. 1993.
Chazelle, B. Cutting hyperplanes for divide-and-conquer, Disc. Comput. Geom., 9 (1993), 145–158.
Chazelle, B. An optimal convex hull algorithm in any fixed dimension, Disc. Comput. Geom. (1993), in press. Prelim. version in Proc. 32nd FOCS, 1991.
Chazelle, B. Geometric discrepancy revisited, Proc. 34th Annual IEEE Symposium on Foundations of Computer Science, Nov. 1993.
Chazelle, B., Edelsbrunner, H., Guibas, L.J., Sharir, M., Snoeyink, J. Computing a face in an arrangement of line segments, Proc. 2nd Ann. ACMSIAM Symp. Disc. Alg. (1991), 441–448.
Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L.J., Sharir, M. Improved bounds on weak ɛ-nets for convex sets, Proc. 25th Ann. ACM Sympos. Theory Comput., May 1993, 495–504.
Chazelle, B., Friedman, J. A deterministic view of random sampling and its use in geometry, Combinatorica 10 (1990), 229–249.
Chazelle, B., Matoušek, J. Derandomizing an output-sensitive convex hull algorithm in three dimensions, manuscript (1991).
Chazelle, B., Matoušek, J. On linear-time deterministic algorithms for optimization problems in fixed dimension, 4th Ann. ACM-SIAM Symp. Disc. Alg. (1993), 281–290.
Clarkson, K.L. Linear programming in O(n × 3 d 2) time, Inf. Process. Lett. 22 (1986), 21–24.
Clarkson, K.L. Las Vegas algorithm for linear programming when the dimension is small, Proc. 29th IEEE Ann. Symp. Foundat. Comput. Sci. (1988), 452–457.
Clarkson, K.L. A randomized algorithm for closest-point queries, SIAM J. Comput. 17 (1988), 830–847.
Clarkson, K.L. New applications of random sampling in computational geometry, Disc. Comput. Geom. 2 (1987), 195–222.
Clarkson, K.L. Randomized geometric algorithms, Euclidean Geometry and Computers, World Scientific Publishing, ed. D. Z. Du and F. K. Hwang, to appear.
Clarkson, K.L., Mehlhorn, K., Seidel, R. Four results on randomized incremental constructions, Proc. STACS, 1992.
Clarkson, K.L., Shor, P.W. Applications of random sampling in computational geometry, II, Disc. Comput. Geom. 4 (1989), 387–421.
Clarkson, K.K., Tarjan, R.E., Van Wyk, C.J. A fast Las Vegas algorithm for triangulating a simple polygon, Disc. and Comput. Geom. 4 (1989), 432–432.
Devillers, O. Randomization yields simple O (n log* n) algorithms for difficult ω(n). problems, Int. J. Comput. Geom. Appl., to appear. Tech Rep. INRIA 1412.
Devillers, O., Meiser, S., Teillaud, M. Fully dynamic Delaunay triangulation in logarithmic expected time per operation, WADS 91, Vol. LNCS 519, Springer-Verlag 1991. Tech Rep. INRIA 1349.
Dyer, M.E. On a multidimensional search technique and its application to the Euclidean 1-centre problem, SIAM J. Comput. 15 (1986), 725–738.
Dyer, M.E. A class of convex programs with applications to computational geometry, Proc. 8th ACM Sympos. Comput. Geom., 1992, 9–15.
Dyer, M.E., Frieze, A.M. A randomized algorithm for fixed-dimensional linear programming, manuscript, 1987.
Edelsbrunner, H., Guibas, L.J., Hershberger, J., Seidel, R., Sharir, M., Snoeyink, J., Welzl, E. Implicitly representing arrangements of lines or segments, Proc. 4th Ann. ACM Sympos. Comput. Geom. (1988), 56–69.
Edelsbrunner, H., Guibas, Sharir, M. The complexity of many faces in arrangements of lines and of segments, Proc. 4th Ann. ACM Sympos. Comput. Geom. (1988), 44–55.
Even, G., Goldreich, O., Luby, M., Nisan, N., Velickovic, B. Approximations of general independent distributions, Proc. 24th STOC (1992), 10–16.
Gärtner, G. A subexponential algorithm for abstract optimization problems. Proc. 33rd IEEE Ann. Symp. Foundat. Comput. Sci., 1992, 464–472.
Guibas, L.J., Knuth, D.,E., Sharir, M. Randomized incremental construction of Delaunay and Voronoi diagrams, Algorithmica 7 (1992), 381–413.
Haussler, D., Welzl, E. Epsilon-nets and simplex range queries, Disc. Comp. Geom. 2, (1987), 127–151.
Impagliazzo, R., Zuckerman, D. How to recycle random bits, Proc. 30th Ann. IEEE Symp. Foundat. Comput. Sci., 1989, 248–253.
Kalai, G., A subexponential randomized simplex algorithm, Proc. 24th ACM Symposium on Theory of Computing, 1992, 475–482.
Koksma, J.F. Een algemeena stelling uit de theorie der gelijkmatige verdeeling modulo 1, Mathematica B (Zutphen), 11 (1942/43), 7–11. (English treatment in [61]).
Linial, N., Luby, M., Saks, M., Zuckerman, D. Efficient construction of a small hitting set for combinatorial rectangles in high dimension, Proc. 25th Ann. ACM Sympos. Theory Comput., May 1993, 258–267.
Luby, M. A simple parallel algorithm for the maximal independent set problem, Proc. 17th Ann. ACM Symp. Theory of Comput. (1985), 1–10.
Matoušek, J. Construction of ε-nets, Disc. Comput. Geom. 5 (1990), 427–448.
Matoušek, J. Cutting hyperplane arrangements, Disc. Comput. Geom. 6 (1991), 385–406.
Matoušek, J. Approximations and optimal geometric divide-and-conquer, Proc. 23rd Ann. ACM Symp. Theory of Comput. (1991), 505–511.
Matoušek, J. Efficient partition trees, Proc. 7th Ann. ACM Symp. Comput. Geom. (1991), 1–9.
Matoušek, J. Reporting points in halfspaces, Proc. 32nd Ann. IEEE Symp. Foundat. Comput. Sci. (Oct. 1991), 207–215.
Matoušek, J. Range searching with efficient hierarchical cuttings, Proc. 8th Ann. ACM Symp. Comput. Geom. (1992), 276–285.
Matoušek, J., Sharir, M., Welzl, E. A subexponential bound for linear programming, Proc. 8th Ann. ACM Symp. Comput. Geom. (1992), 1–8.
Matoušek, J., Welzl, E., Wernisch, L. Discrepancy and ε-approximations for bounded VC-dimension, Proc. 32nd Ann. IEEE Symp. Foundat. Comput. Sci. (1991), 424–430.
Megiddo, N. Linear programming in linear time when the dimension is fixed, J. ACM 31 (1984), 114–127.
Mitchell, D.P. Spectrally optimal sampling for distribution ray tracing, Computer Graphics, 25 (1991), 157–164.
Mulmuley, K. A fast planar point location algorithm I, Proc. 29th Ann. IEEE Symp. Foundat. Comput. Sci. (1988), 580–589.
Mulmuley, K. On obstructions in relation to a fixed viewpoint, Proc. 30th Ann. IEEE Symp. Foundat. Comput. Sci. (1989), 592–597.
Mulmuley, K. On levels in arrangements and Voronoi diagrams, Discrete Comput. Geom. 6 (1990), 307–338.
Mulmuley, K. A fast planar point location algorithm II, J. ACM 38 (1991), 74–103.
Mulmuley, K. An efficient hidden surface removal algorithm, manuscript.
Mulmuley, K. Randomized geometric algorithms and pseudo-random generators, Proc. 33rd Ann. IEEE Symp. Foundat. Comput. Sci. (1992), 90–100.
Naor, J., Naor, M. Small-bias probability spaces: efficient constructions and applications, Proc. 22nd Ann. ACM Symp. Theory of Comput. (1990), 213–223.
Niederreiter, H. Random number generation and quasi-Monte Carlo methods, CBMS-NSF, 1992.
Raghavan, P. Probabilistic construction of deterministic algorithms: approximating packing integer programs, J. Comput. System Sci. 37 (1988), 130–143.
Reif, J.H., Sen, S. Optimal randomized parallel algorithms for computational geometry, Proc. 16th Internat. Conf. Parallel Processing, St. Charles, IL, 1987. Full version, Duke Univ. Tech. Rept., CS-88-01, 1988.
Seidel, R. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Comput. Geom.: Theory and Appl. 1 (1991), 51–64.
Seidel, R. Small-dimensional linear programming and convex hulls made easy, Disc. Comput. Geom. 6 (1991), 423–434.
Shirley, P. Discrepancy as a quality measure for sample distributions, Proc. Eurographics'91, (1991), 183–193.
Spencer, J. Ten lectures on the probabilistic method, CBMS-NSF, SIAM, 1987.
Stolarsky, K.B. Sums of distances between points on a sphere. II, Proc. Amer. Math. Soc., 41 (1973), 575–582.
Vapnik, V.N., Chervonenkis, A.Ya. On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 16 (1971), 264–280.
Weyl, H. Über die gleichverteilung von zahlen mod. eins. Math. Ann., 77 (1916), 111–147.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag
About this paper
Cite this paper
Chazelle, B. (1994). Deterministic sampling and optimization. In: Henry, J., Yvon, JP. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035458
Download citation
DOI: https://doi.org/10.1007/BFb0035458
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19893-2
Online ISBN: 978-3-540-39337-5
eBook Packages: Springer Book Archive