rule of thumb for the number of dimensions above which a K-d tree is not ideal container:
rough dimension limit = log base 2 of the number of data points (n)
import numpy as NP
fnx = lambda n: NP.log2(n)
Last active
August 29, 2015 14:08
-
-
Save alexland/c7a6d9fe077002550adc to your computer and use it in GitHub Desktop.
simple formulas, constants, etc., i don't always remember
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment