Applications of random sampling in computational geometry, II

Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988

Volumn , Issue , 1988, Pages 1-11

  Clarkson, Kenneth L ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY;

EXPECTED TIME; GEOMETRIC ALGORITHM; LAS VEGAS ALGORITHMS; QUANTITY OF INTEREST; RANDOM BEHAVIOR; RANDOM SAMPLING; SET OF LINES; SIMPLE POLYGON;

GEOMETRY;

EID: 85033220215     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73393.73394     Document Type: Conference Paper

References (19)

1. N. Alon and E. Györi. The number of small semispaces of a finite set of points in the plane. J. Combin. Theory Ser. A, 41:154-157, 1986.
2. N. Alon, D. Haussler, and E. Welzl. Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension. In Proc. Third Symp. on Comp. Geometry, pages 331-340, 1987.
3. K. L. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl. The complexity of many faces in an arrangement of lines in the plane. To appear, 1988.
4. K. L. Clarkson. A probabilistic algorithm for the post office problem. In Proc. 17th Annual SIGACT Symp., pages 75-184, 1985.
5. K. L. Clarkson. New applications of random sampling in computational geometry. Discrete & Comp. Geom., 2:195-222, 1987.
6. B. Chazelle and F. P. Preparata. Half-space range search: an algorithmic application of k-sets. In Discrete & Comp. Geom., pages 83-94, 1986.
7. K. L. Clarkson and P. W. Shor. Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental. This proceedings, 1988.
8. R. Cole, M. Sharir, and C. Yap. On k-hulls and related problems. In Proc. 16th Annual SIGACT Symp., pages 154-166, 1984.
9. K. L. Clarkson, R. E. Tarjan, and C. J. Van Wyk. A fast Las Vegas algorithm for triangulating a simple polygon. This proceedings, 1988.
10. H. Edelsbrunner. Personal communication.
11. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, New York, 1987.
12. H. Edelsbrunner and E. P. Muecke. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. This proceedings, 1988.
13. P. Erdos and J. Spencer. Probabilistic Methods in Combinatorics. Academic Press, New York, 1974.
14. J. E. Goodman and R. E. Pollack. On the number of k-subsets of a set of n points in the plane. J. Combin. Theory Ser. A, 36:101-104, 1984.
15. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete & Comp. Geom., 2:127-151, 1987.
16. D. G. Kirkpatrick and R. Seideal. The ultimate planar convex hull algorithm? SIAM Journal on Computing, 15:287-299, 1986.
17. R. E. Tarjan and C. J. Van Wyk. An O(n log log n) algorithm for triangulating a simple polygon. SIAM Journal on Computing, 17:143-178, 1988.
18. E. Welzl. More on k-sets of finite sets in the plane. Discrete & Comp. Geom., 1:95-100, 1986.
19. C. K. Yap. A geometric consistency theorem for a symbolic perturbation scheme. This proceedings, 1988.