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
ENG
Keywords

GEOMETRY

Citation

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.6, no.4, pp.253 - 262

ISSN
0925-7721
DOI
10.1016/0925-7721(95)00025-9
URI
http://hdl.handle.net/10203/327
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
1992-45.pdf(678.46 kB)Download
  • Hit : 520
  • Download : 198
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 8 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0