 \log^{0d} n\right)$. This time is per cube of $F$ that covers $B(q,D_{\text{rough}})$. Noting that there are $0^d$ such cubes gives us a final time complexity of $O\left(0^{0d}   \frac{0}{{\varepsilon}^d} \mu^{0d} d^{\frac{d}{0}} \log^{0d} n \right)$