In classical kD-trees, the splitting dimension is chosen using a simple and systematic rule: dimensions are taken in a round-robin fashion.
But extra freedom is available because you could very well choose the splitting dimension at will on every level, and even differently on every node.
Has this been investigated ? Can it yield some gain in performance ? How to efficiently determine an optimal splitting scheme among the exponentially numerous possibilities ?