Skip to main content
Conference ProceedingsOPEN ACCESS

A deterministic algorithm for the three-dimensional diameter problem

Proceedings of the Annual ACM Symposium on Theory of Computing (1993) Part F129585 478-484
DOI: 10.1145/167088.167217
12Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

Abstract

We give a deterministic Algorithm for computing the diameter of an n point set in three dimensions with 0(n logc n) running time, c a constant.

Cite

CITATION STYLE

APA

Matoušek, J., & Schwarzkopf, O. (1993). A deterministic algorithm for the three-dimensional diameter problem. In Proceedings of the Annual ACM Symposium on Theory of Computing (Vol. Part F129585, pp. 478–484). Association for Computing Machinery. https://doi.org/10.1145/167088.167217

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free