s $Q$. We then carry out a quadtree search on each element of $Q$. Note that we expand only cells which may contain a point nearer to query point $q$ than the current best candidate. We bound the depth of our search using $\mu$-defectiveness similar to Lemma \[