Has anyone implemented Lowe's best bin first algorithm for fast, approximate nearest neighbour search in ITK? It looks like it should be a relatively simple extension, but I'm still finding my way around the KD tree.