b****t
发帖数: 114 | 1 Hi all,
Given an arbitary point in R^n space, is there a fast way to find k (k<=2^n)
closest integer points in the space?
I know for k=1, using simply floor function to get the closest integer point.
z(i) = floor(x(i)+.5).
Can anyone give me similarly method to get k closest integer points?
Thanks a lot,
Beet |
|
