Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental

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

Volumn , Issue , 1988, Pages 12-17

  Clarkson, Kenneth L ^a   Shor, Peter W ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY;

ALGORITHMIC TECHNIQUES; EXPECTED TIME; GEOMETRIC STRUCTURE; INTERSECTION PROBLEM; LAS VEGAS ALGORITHMS; RANDOM BEHAVIOR; RANDOMIZED REDUCTIONS; THREE DIMENSIONS;

COMPUTATIONAL GEOMETRY;

EID: 85023920019     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73393.73395     Document Type: Conference Paper

References (9)

1. A. Aggarwal. personal communication.
2. L. P. Chew. Building Voronoi diagrams for convex polygons in linear expected time, unpublished manuscript, 1986.
3. K. L. Clarkson. Random sampling in computational geometry, II. This proceedings, 1988.
4. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, New York, 1987.
5. H. Edelsbrunner, D. G. Kirkpatrick, and R. Seidel. On the shape of a set of points in the plane. IEEE Trans. Inform. Theory, IT-29:551-559, 1983.
6. H. Edelsbrunner, J. O'Rourke, and R. Seidel. Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing, 15:341-363, 1986.
7. A. Heppes. Beweis einer Vermutung von A. Vázsonyi. Acta Math. Acad. Sci. Hungar., 7:463-466, 1956.
8. F. P. Preparata and S. J. Hong. Convex hulls of finite sets of points in two and three dimensions. Communications of the ACM, 20:87-93, 1977.
9. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.