title: Walk a line between two points in a 3D voxel space visiting all cells
body: <p>I have a line-of-sight problem I need to solve by visiting all possible cells in a 3D voxel space between two (non-grid-aligned) points.</p>
  
  <p>I have considered using a 3D Bresenham algorithm, but it will skip out some cells.</p>
  
  <p>A naive implementation might be to just check points along the line at a higher resolution than the voxel grid, but I was hoping for a more intelligent solution.</p>
  
  <p>Anyone got any leads?</p>