Find all neighbors at a certain distance, in 3 dimensions
I recommend using a k-d tree or an octree to store the list of points.  They support efficient nearest neighbor search.

If you need to update the list, look at R-trees, which allow your list to be dynamic: you can add or delete from the list and efficiently update the R-tree data structure.