I need something like bressenham algorithm but not quite and for 3d grid-space
I got 3d grid of cells (edge size 1.0) need to start in point S and advance to point K 'touching' all the cells tha line touches (even if only edge point is touched i need to tpuch all 8 cells)
Need to use it for traversal writing values to the cells or reading values from the cells and need it to be as fast as managable (it would be in massive use of drawing milions of such 3d grid lines per frame)
Could somebody say how it could look like? tnx
Consider using of Woo and Amanatides grid traversal algorithm: article "Fast Voxel Traversal Algorithm..."
Practical implementation is in grid traversal section here
2d-case illustration: