Is there a fast (i.e. not incremental step) algorithm to find all voxels that a line intersects in 3d space?
I compare to Bresenham\'s line algorithm, but I
