## An Efficient Algorithm for the Three-Dimensional Diameter Problem
O(nlog running time.
The algorithm is quite simple and is a good candidate to be implemented
in practice.
Using our approach the chromatic diameter and all-furthest neighbors
in ^{2}n)R can be found in the same running time.
^{3}@article{b-eatddp-01, author = "S. Bespamyatnikh", title = "An Efficient Algorithm for the Three-Dimensional Diameter Problem", journal = "Discrete Comput. Geom.", year = 2001, volume = 25, number = 2, pages = "235--255" } |