A deterministic algorithm for the three-dimensional diameter problem

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 478-484

  Matoušek, Jiří ^a   Schwarzkopf, Otfried ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC ALGORITHMS; DIAMETER PROBLEM; POINT SET; RUNNING TIME; THREE DIMENSIONS;

COMPUTATION THEORY; ALGORITHMS;

PARALLEL PROCESSING SYSTEMS; RANDOM PROCESSES; SET THEORY; THEOREM PROVING; THREE DIMENSIONAL;

DETERMINISTIC ALGORITHMS; THREE DIMENSIONAL DIAMETER PROBLEM;

EID: 0027313812     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167217     Document Type: Conference Paper

References (11)

1. [Cha92] B. Chazelle. Cutting hyperplanes for divide-And-conquer. Discrete & Computational Geometry, 1992. To appear. Preliminary version: Proc. 32nd IEEE Symposium on Foundations of Computer Science (1991).
2. [CEGS92] B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir. Diameter, width, closest line pair, and parametric searching. In Proc. 8th Annu. ACM Sympos. Coviput. Geom., pages 120-129, 1992.
3. [CF90] B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in geometry. Combinatorica, 10:229-249, 1990.
4. [CS89] K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry II. Discrete & Computational Geometry, 4:387-421, 1989.
5. [Dye92] M. Dyer. A class of convex programs with applications to computational geometry. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 9-15, 1992.
6. [Mat91] J. Matousek. Cutting hyperplane arrangements. Discrete & Computational Geometry, 6(5):385-406, 1991.
7. [Mat91a] J. Matousek. Approximation and geometric divide and conquer. In Proc. 23rd Annu. ACM Sympos. Theory Comput., pages 505511, 1991.
8. [Mat92] J. Matousek. Efficient partition trees. Discrete & Computational Geometry 8:315 -334 (1992).
9. [Meg83] N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM, 30:852-865, 1983.
10. [Ren92] J. Renegar. On the computational complexity and geometry of the first order theory of the reals. Journal of Symbolic Computaiion, 1992.
11. [YY85] F. F. Yao and A. C. Yao. A general approach to geometric queries. In Proc. 17. ACM Symposium on Theory of Computing, pages 163-168, 1985.