|
Oct
25 |
|
awarded | Nice Question |
|
Oct
25 |
|
awarded | Scholar |
|
Oct
25 |
|
comment |
Sorting by Euclidean distance Thanks, this is helpful! |
|
Oct
25 |
|
accepted | Sorting by Euclidean distance |
|
Oct
24 |
|
comment |
Sorting by Euclidean distance For example, if I store S as a 2-d-tree, I can find one nearest neighbour in O(log n) time. Maybe there is a similar solution for my task. I'm not a great expert in spatial data structures - and there is so many of them - I could easily miss it. |
|
Oct
24 |
|
comment |
Sorting by Euclidean distance The point is that I have practically unlimited time to prepare my set of points, but the time to sort them is very much limited. That said, any speed-up of standard sorting is appreciated - even if it is same O(n log n), but faster in worst case (or best case, or whatever). |
|
Oct
24 |
|
awarded | Student |
|
Oct
24 |
|
asked | Sorting by Euclidean distance |
