1 code implementation • 8 Dec 2020 • Sepideh Aghamolaei, Vahideh Keikha, Mohammad Ghodsi, Ali Mohades
Assuming $L$ is the diameter of $P$ and $\delta$ is the minimum distance between points on disjoint edges of $P$, we show the approximation factor of the existing $O(\frac{\log (L/\delta)}{\epsilon}n^3)$ time algorithm is $1+\epsilon$-approximation algorithm.
Computational Geometry