Applications of random sampling in computational geometry, II
 Kenneth L. Clarkson,
 Peter W. Shor
 … show all 2 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
We use random sampling for several new geometric algorithms. The algorithms are “Las Vegas,” and their expected bounds are with respect to the random behavior of the algorithms. These algorithms follow from new general results giving sharp bounds for the use of random subsets in geometric algorithms. These bounds show that random subsets can be used optimally for divideandconquer, and also give bounds for a simple, general technique for building geometric structures incrementally. One new algorithm reports all the intersecting pairs of a set of line segments in the plane, and requiresO(A+n logn) expected time, whereA is the number of intersecting pairs reported. The algorithm requiresO(n) space in the worst case. Another algorithm computes the convex hull ofn points inE ^{ d } inO(n logn) expected time ford=3, andO(n ^{[d/2]}) expected time ford>3. The algorithm also gives fast expected times for random input points. Another algorithm computes the diameter of a set ofn points inE ^{3} inO(n logn) expected time, and on the way computes the intersection ofn unit balls inE ^{3}. We show thatO(n logA) expected time suffices to compute the convex hull ofn points inE ^{3}, whereA is the number of input points on the surface of the hull. Algorithms for halfspace range reporting are also given. In addition, we give asymptotically tight bounds for (≤k)sets, which are certain halfspace partitions of point sets, and give a simple proof of Lee's bounds for highorder Voronoi diagrams.
 P. K. Agarwal. An efficient deterministic algorithm for partitioning arrangements of lines and its applications. InProceedings of the Fifth Symposium on Computational Geometry, pages 11–22, 1989.
 A. Aggarwal. Personal communication.
 Alon, N., Györi, E. (1986) The number of small semispaces of a finite set of points in the plane. J. Combin. Theory Ser. A 41: pp. 154157 CrossRef
 N. Alon, D. Haussler, and E. Welzl. Partitioning and geometric embedding of range spaces of finite VapnikChervonenkis dimension. InProceedings of the Third Symposium on Computational Geometry, pages 331–340, 1987.
 B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. InProceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 590–600, 1988.
 Chazelle, B., Guibas, L. J., Lee, D. T. (1985) The power of geometric duality. BIT 25: pp. 7690 CrossRef
 Chazelle, B., Preparata, F. P. (1986) Halfspace range search: an algorithmic application ofksets. Discrete Comput. Geom. 1: pp. 8393 CrossRef
 Chazelle, B., Welzl, E. (1989) Range searching and VCdimension: a characterization of efficiency. Freie Universität Berlin, Institut für Mathematik III, Arnimallee 26, 1000 Berlin 33
 L. P. Chew. Building Voronoi diagrams for convex polygons in linear expected time. Unpublished manuscript, 1986.
 K. L. Clarkson. A probabilistic algorithm for the post office problem. InProceedings of the 17th Annual SIGACT Symposium, pages 175–184, 1985.
 Clarkson, K. L. (1987) New applications of random sampling in computational geometry. Discrete Comput. Geom. 2: pp. 195222
 B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in computational geometry. InProceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 539–549, 1988.
 K. L. Clarkson. A Las Vegas algorithm for linear programming when the dimension is small. InProceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 452–456, 1988. Revised version: Las Vegas algorithms for linear and integer programming when the dimension is small (preprint).
 K. L. Clarkson. Applications of random sampling in computational geometry, II. InProceedings of the Fourth Symposium on Computational Geometry, pages 1–11, 1988.
 K. L. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl. Combinatorial complexity bounds for arrangements of curves and surfaces. InProceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 568–579, 1988.
 K. L. Clarkson and P. W. Shor. Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental. InProceedings of the Fourth Symposium on Computational Geometry, pages 12–17, 1988.
 K. L. Clarkson, R. E. Tarjan, and C. J. Van Wyk. A fast Las Vegas algorithm for triangulating a simple polygon.Discrete Comput. Geom., this issue, pages 423–432.
 Cole, R., Sharir, M., Yap, C. (1987) Onkhulls and related problems. SIAM J. Comput. 16: pp. 6177 CrossRef
 H. Edelsbrunner. Personal communication.
 Edelsbrunner, H. (1987) Algorithms in Combinatorial Geometry. SpringerVerlag, New York
 Edelsbrunner, H., Kirkpatrick, D. G., Seidel, R. (1983) On the shape of a set of points in the plane. IEEE Trans. Inform. Theory 29: pp. 551559 CrossRef
 H. Edelsbrunner and E. P. Mücke. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. InProceedings of the Fourth Symposium on Computational Geometry, pages 118–113, 1988.
 Edelsbrunner, H., O'Rourke, J., Seidel, R. (1986) Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput. 15: pp. 341363 CrossRef
 Erdös, P., Spencer, J. (1974) Probabilistic Methods in Combinatorics. Academic Press, New York
 Goodman, J. E., Pollack, R. E. (1984) On the number ofksubsets of a set ofn points in the plane. J. Combin. Theory Ser. A 36: pp. 101104 CrossRef
 Greene, D. H., Knuth, D. E. (1981) Mathematics for the Analysis of Algorithms. Birkhäuser, Boston
 Guibas, L. J., Stolfi, J. (1985) Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. Graphics 4: pp. 75123 CrossRef
 Haussler, D., Welzl, E. (1987) Epsilonnets and simplex range queries. Discrete Comput. Geom. 2: pp. 127151
 Heppes, A. (1956) Beweis einer Vermutung von A. Vázsonyi. Acta Math. Acad. Sci. Hungar. 7: pp. 463466 CrossRef
 Hoare, C. A. R. (1962) Quicksort. Comput. J. 5: pp. 1015 CrossRef
 Kirkpatrick, D. G., Seidel, R. (1986) The ultimate planar convex hull algorithm?. SIAM J. Comput. 15: pp. 287299 CrossRef
 J. Matoušek. Construction of ɛnets. InProceedings of the Fifth Symposium on Computational Geometry, pages 1–10, 1989.
 Megiddo, N. (1984) Linear programming in linear time when the dimension is fixed. J. Assoc. Comput. Mach. 31: pp. 114127
 Muller, D. E., Preparata, F. P. (1978) Finding the intersection of two convex polyhedra. Theoret. Comput. Sci. 7: pp. 217236 CrossRef
 K. Mulmuley. A fast planar partition algorithm: part I. InProceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 580–589, 1988.
 Preparata, F. P., Hong, S. J. (1977) Convex hulls of finite sets of points in two and three dimensions. Comm. ACM 20: pp. 8793 CrossRef
 Preparata, F. P., Shamos, M. I. (1985) Computational Geometry: An Introduction. SpringerVerlag, New York
 J. Reif and S. Sen. Optimal parallel algorithms for computational geometry. InProceedings of the 16th International Conference on Parallel Processing, 1987.
 J. Reif and S. Sen. Polling: a new randomized sampling technique for computational geometry. InProceedings of the 21st Annual SIGACT Symposium, pages 394–404, 1989.
 R. Seidel. A convex hull algorithm optimal for point sets in even dimensions. Technical Report 81/14, Dept. Computer Science, University of British Columbia, 1981.
 R. Seidel. Constructing higher dimensional convex hulls at logarithmic cost per face. InProceedings of the 18th Annual SIGACT Symposium, pages 404–413, 1986.
 Welzl, E. (1986) More onksets of finite sets in the plane. Discrete Comput. Geom. 1: pp. 95100 CrossRef
 E. Welzl. Partition trees for triangle counting and other range searching problems. InProceedings of the Fourth Symposium on Computational Geometry, pages 23–33, 1988.
 C. K. Yap. A geometric consistency theorem for a symbolic perturbation scheme. InProceedings of the Fourth Symposium on Computational Geometry, pages 134–142, 1988.
 Title
 Applications of random sampling in computational geometry, II
 Journal

Discrete & Computational Geometry
Volume 4, Issue 1 , pp 387421
 Cover Date
 19891201
 DOI
 10.1007/BF02187740
 Print ISSN
 01795376
 Online ISSN
 14320444
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 Authors

 Kenneth L. Clarkson ^{(1)}
 Peter W. Shor ^{(1)}
 Author Affiliations

 1. AT&T Bell Laboratories, 07974, Murray Hill, NJ, USA