Bresenham's 3D Line algorithm

The Bresenham line algorithm provides points in a 3-dimensional Matrix which form a close approximat

The Bresenham line algorithm is an algorithm that determines which points in a 3-dimensional raster should be plotted in order to form a close approximation to a straight line between two given points in 3D space.
The common conventions that pixel coordinates increase in the down and right directions and that pixel centers have integer coordinates will be used. The endpoints of the line are the pixels at (x0, y0, z0) and (x1, y1,z1), where the first coordinate of the pair is the column, the second is the row and the third is the slice.