1
$\begingroup$

i am looking for algorithms which use sorting in low-dimensional space like $R$ and how they are generalized for higher-dimensional spaces like $R^2$ where there is no sorting possible. (i.e. numbers you can sort, for vectors you can't have a real order)

$\endgroup$
1
  • $\begingroup$ I think this question is too broad. -- Can you perhaps be more precise in what you are looking for? $\endgroup$
    – Stefan Kohl
    Oct 10, 2014 at 19:06

1 Answer 1

1
$\begingroup$

The magic words are: k-d tree.

$\endgroup$

Not the answer you're looking for? Browse other questions tagged or ask your own question.