KD-TREE PARTITIONING Just some quick tests applying a simple median based kd-tree algorithm to the luminance values of an image. The recursive splitting is stopped after reaching a summed up luminance around 1.0 in each subspace. Teilen mit:TwitterFacebookLike this:Like Loading...