no code implementations • 27 Oct 2018 • Mahdi Imanparast, Seyed Naser Hashemi
We propose a new $(1+O(\varepsilon))$-approximation algorithm with $O(n+ 1/\varepsilon^{\frac{(d-1)}{2}})$ running time for computing the diameter of a set of $n$ points in the $d$-dimensional Euclidean space for a fixed dimension $d$, where $0 < \varepsilon\leqslant 1$.
Computational Geometry
no code implementations • 26 Oct 2016 • Mahdi Imanparast, Seyed Naser Hashemi, Ali Mohades
In this paper, we study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+\varepsilon)$-approximation algorithm with $O(n+ 1/\varepsilon^{d-1})$ time and $O(n)$ space, where $0 < \varepsilon\leqslant 1$.
Computational Geometry 65D18 68W25 68U05
