t******t
发帖数: 51 | 1 Given N points in a 3-D space, find all pairs of points whose distances are
exactly a given number p. An
obvious solution is to calculate all pairwise distances with time complexity
O(N^2). Any solutions that are
more efficient than that? Thanks. | b******k
发帖数: 18 | 2 kd tree?
are
complexity
【在 t******t 的大作中提到】
: Given N points in a 3-D space, find all pairs of points whose distances are
: exactly a given number p. An
: obvious solution is to calculate all pairwise distances with time complexity
: O(N^2). Any solutions that are
: more efficient than that? Thanks.
|
|
