A deterministic algorithm for the three-dimensional diameter problem
We give a deterministic algorithm for computing the diameter of an n-point set in three dimensions with O(n log(c)n) running time, where c is a constant.
- Publisher
- ELSEVIER SCIENCE BV
- Issue Date
- 1996-07
- Language
- English
- Article Type
- Article
- Keywords
GEOMETRY
- Citation
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.6, no.4, pp.253 - 262
- ISSN
- 0925-7721
- Appears in Collection
- CS-Journal Papers(저널논문)
- Files in This Item
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 8 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.