An optimal deterministic algorithm for computing the diameter of a three-dimensional point set

Discrete and Computational Geometry

Volumn 26, Issue 2, 2001, Pages 233-244

  Ramos, E A ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035634204     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-001-0029-8     Document Type: Article

References (37)

1. P. K. Agarwal, H. Edelsbrunner, O. Schwarzkopf and E. Welzl. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete Comput. Geom. 6 (1991), 407-422.
2. P. K. Agarwal and J. Matoušek. On range searching with semialgebraic sets. Discrete Comput. Geom. 11 (1994), 393-418.
3. N. M. Amato, M. T. Goodrich and E. A. Ramos. Parallel algorithms for higher-dimensional convex hulls. In Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci. (FOCS 94), pp. 683-694, 1994.
4. N. M. Amato, M. T. Goodrich and E. A. Ramos. Computing faces in segment and simplex arrangements. In Proc. 26th Annu. ACM Sympos. Theory Comput. (STOC 95), pp. 672-682, 1995.
5. N. M. Amato, M. T. Goodrich, and E. A. Ramos. Computing the Arrangement of Curve Segments: Divide-and-Conquer Algorithms via Sampling. Manuscript, 1999. Short abstract in Proc. 9th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA 00), pp. 705-706, 2000. Available from http:// www.mpi-sb.mpg.de/∼ramos
6. N. M. Amato and E. A. Ramos. On computing Voronoi diagrams by divide-prune-and-conquer. In Proc. 12th Annu. ACM Sympos. Comput. Geom. (SoCG 96), pp. 672-682, 1996.
7. S. Bespamyatnikh. An efficient algorithm for the three-dimensional diameter problem. In Proc. 9th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA 98), pp. 137-146, 1998.
8. B. Chazelle, H. Edelsbrunner, L. Guibas and M. Sharir. Diameter, width, closest line pair, and parametric searching, Discrete Comput. Geom. 10 (1993), 183-196.
9. B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in geometry. Combinatorica, 10 (1990) 229-249.
10. K. L. Clarkson. A randomized algorithm for closest-point queries. SIAM J. Comput. 17 (1988), 830-847.
11. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4 (1989), 387-421.
12. F. Dehne, X. Deng, P. Dymond, A. Fabri and A. Khokbar. A randomized parallel 3D convex hull algorithm for coarse grained multicomputers. In Proc. ACM Sympos. Parallel Algorithms Architectures (SPAA 95), pp. 27-33, 1995.
13. X. Deng and B. Zhu. A randomized algorithm for the Voronoi diagram of line segments on coarse grained multiprocessors. Algorithmica 24 (1999), 270-286.
14. D. P. Dobkin and D. G. Kirkpatrick. Fast detection of polyhedral intersection. Theoret. Comput. Sci. 27 (1983), 241-253.
15. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, 1987.
16. H. Edelsbrunner and E. P. Mücke. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph. 9 (1990), 66-104.
17. I. Z. Emiris, J. F. Canny and R. Seidel. Efficient perturbations for handling geometric degeneracies. Algorithmica 19 (1997), 219-242.
18. M. T. Goodrich. Planar separators and parallel polygon triangulation. J. Comput. System Sci. 51 (1995), 374-389.
19. M. T. Goodrich and E. A. Ramos. Bounded independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming. Discrete Comput. Geom. 18 (1997), 397-420.
20. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete Comput. Geom. 2 (1987), 127-151.
21. A. Heppes. Beweis einer Vermutung von A. Vázsonyi. Acta Math. Acad. Sci. Hungar. 7 (1956), 463-466.
22. U. Kühn. Lokale Eigenschaften in der algorithmischen Geometrie mit Anwendungen in der Parallelverarbeitung. Inaugural-Dissertation, Fachbereich Mathematik und Informatik, Westfälische Wilhelms-Universität Münster, 1998.
23. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM J. Comput. 36 (1979), 177-189.
24. J. Matoušek. Approximations and optimal geometric divide-and-conquer. In Proc. 23rd Annu. ACM Sympos. Theory Comput. (STOC 91), pp. 505-511, 1991. Also in J. Comput. System Sci. 50, 203-208 (1995).
25. J. Matoušek. Approximations and optimal geometric divide-and-conquer. In Proc. 23rd Annu. ACM Sympos. Theory Comput. (STOC 91), pp. 505-511, 1991. Also in J. Comput. System Sci. 50, 203-208 (1995).
26. J. Matoušek. Efficient partition trees Discrete Comput. Geom. 8 (1992), 315-334.
27. J. Matoušek. Derandomization in computational geometry. J. Algorithms 20 (1996), 545-580.
28. J. Matoušek and O. Schwarzkopf. A deterministic algorithm for the three-dimensional diameter problem. In Proc. 25th Annu. ACM Sympos. Theory Comput. (STOC 93), pp. 478-484, 1993. Revised version in Comput. Geom. Theory Appl. 6 (1996), 253-262.
29. J. Matoušek and O. Schwarzkopf. A deterministic algorithm for the three-dimensional diameter problem. In Proc. 25th Annu. ACM Sympos. Theory Comput. (STOC 93), pp. 478-484, 1993. Revised version in Comput. Geom. Theory Appl. 6 (1996), 253-262.
30. K. Mulmuley. Computational Geometry: An Introduction through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, NJ, 1994.
31. F. Preparata and M. I. Shamos, Computational Geometry - An Introduction, Springer-Verlag, New York, 1985.
32. 3. Comput. Geom. Theory Appl. 8 (1995), 57-65.
33. E. A. Ramos Constructing 1-d lower envelopes and applications. In Proc. 13th Annu. ACM Sympos. Comput. Geom. (SoCG 97), pp. 57-66, 1997.
34. V. N. Vapnik and A. Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16 (1971), 264-280.
35. A. C. Yao. On constructing minimum spanning trees in k-dimensional space and related problems. SIAM J. Comput. 11 (1982), 721-736.
36. A. C. Yao and F. F. Yao. A general approach to D-dimensional geometric queries. In Proc. 17th Annu. ACM Sympos. Theory Comput. (STOC 85), pp. 163-168, 1985.
37. C. K. Yap. A geometric consistency theorem for a symbolic perturbation scheme. J. Comput. System Sci. 39 (1989), 236-246.