Before revision:  Specifically, we give an algorithm that runs in 2^{ \mathcal{O (1/\varepsilon^{d-1})} n\log n time.
After revision:  Specifically, we give an algorithm that runs in 2^{ O (1/\varepsilon^{d-1})} n\log n time.