h****r
发帖数: 258 | 1 Anyone has an idea about my problem?
Suppose I divided a cube in 3D into a series of voxels (say 100x100x100). In
some of these voxels, I randomly place some particles. The total number of
particles is about 500,000. On center of each of these voxels, I need to
calculate a value which is the function of the distance to the closest
particle. Is there an efficient way to do this?
Now the only approach I could think of is using a Kd-tree. But I think kd-
tree is more suitable for situations when |
|
