I'm well aware of the marching / DDA algorithms, but instead I would like to be able to do a per voxel-ray pair check, in constant time, without having to "march" through the voxel space. How would I go about this?

To be clear, I am not trying to find the *first* voxel a ray intersects, but rather, given a ray and a voxel, determine if that voxel's cell even lies within the ray's path.