fix p0 not beginning in Q0. next point set with mistakes
search works, but... NNPerf still has O(sqrt(n)) worst case time. Ouch. It really looks like Eppstein et al. make a mistake with the proof.
...
ok, one more idea: it is save in Q0 to calculate minDist not based on b.hyperCube, but min(b.children) where children = non-empty-branches. that might be enough for the necessary convergence to kick in?
ok, that gives us only a constant speed increase
again at best a constant factor
nonono
putting hope in min/max metrics. not working right now. so that's it. forget about this crap and go back to the old implementation which was not worse than O(sqrt n)
ok, back to normal, tests pass