Randomized Quickhull

Algorithmica (New York)

Volumn 17, Issue 3, 1997, Pages 322-329

  Wenger, R ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

Computational geometry; Convex hull; Randomized algorithm

Indexed keywords

EID: 0039592816     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02523195     Document Type: Article

References (20)

1. Akl, S. G., and Toussaint, G. T. A fast convex hull algorithm. Inform. Process. Lett. 7(5) (1978), 219-222.
2. Avis, D. Comments on a lower bound for convex hull determination. Inform. Process. Lett. 11 (1980), 126.
3. Bentley, J. L., and Shamos, M. I. Divide-and-conquer for linear expected time. Inform. Process. Lett. 7 (1978), 87-91.
4. Bykat, A. Convex hull of a finite set of points in two dimensions. Inform. Process. Lett. 7 (1978), 296-298.
5. Chan, T. Output-sensitive results on convex hulls, extreme points, and related problems. Proc. 11th Anna. ACM Symp. on Computational Geometry, 1995, pp. 10-19.
6. Chan, T., Snoeyink, J., and Yap, C. K. Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three. Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 282-291.
7. Clarkson, K. L. New applications of random sampling in computational geometry. Discrete Comput. Gram. 2 (1987), 195-222.
8. Clarkson, K. L. A randomized algorithm for closest-point queries. SIAM J. Comput. 17 (1988), 830-847.
9. Clarkson, K. L., and Shor, P. W. Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4, (1989), 387-421.
10. Devroye, L. P. How to reduce the average complexity of convex hull finding algorithms. Comput. Math. Appl. 7 (1981), 299-308.
11. Eddy, W. F. A new convex hull algorithm for planar sets. ACM Trans. Math. Software 3 (1977), 398-403 and 411-412.
12. Graham, R. L. An efficient algorithm for determining the convex hull of a finite planar set. Inform. Process. Lett. 1 (1972), 132-133.
13. Green, P. J., and Silverman, B. W. Constructing the convex hull of a set of points in the plane. Comput. J. 22 (1979), 262-266.
14. Jarvis, R. A. On the identification of the convex hull of a finite set of points in the plane. Inform. Process. Lett. 2 (1973), 18-21.
15. Kirkpatrick, D. G., and Seidel, R. The ultimate planar convex hull algorithm? SIAM J. Comput. 15 (1986), 287-299.
16. Koplowitz, J., and Jouppi, D. A more efficient convex hull algorithm. Inform. Process. Lett. 7 (1978), 56-57.
17. Preparata, F. P., and Shamos, M. I. Computational Geometry: an Introduction. Springer-Verlag, New York, 1985.
18. Seidel, R. Backwards analysis of randomized geometric algorithms. In New Trends in Discrete and Computational Geometry, J. Pach, Ed., Algorithms and Combinatorics, vol. 10. Springer-Verlag, 1993, pp. 37-68.
19. Shafer, L., and Steiger, W. Randomizing optimal geometric algorithms. Proc. 5th Canad. Conf. on Computational Geometry, Waterloo, 1993, pp. 133-138.
20. Yao, A. C. A lower bound to finding convex hulls. J. Assoc. Comput. Mach. 28 (1981), 780-787.