Hi, I apologize if this question has been asked before but I have looked and cannot find the answer.
Similar to my previous question, lets say you have a grid with cells in the x-direction from [1:5] and in the y-direction from [1:5] (5 x 5 grid). Now lets say you have two points on the grid: (0.35, 2.65) and (4.2,4.73).
Is there a simple way to determine which grid cells the line connecting those two points passes through (and the distances of each line segment)?
It is very easily visually to see which cells the line passes through (see figure below). Clearly the line segment passes through cells B1, C1, C2, D2, D3, E3 and E4.
Determining the distances of each line segment through each cell would be more difficult by hand.
I have currently solved the problem by finding the slope and intercept of the line, then determining the intercepts of the line with the grid cell lines. Using this, I can determine the distance of each line segment. Then, to find which cell the line segment falls in, I have to find the centre point of each grid cell and the midpoint of each line segment and do a for loop to determine the minimum distance between each line segment and each cell centre.
Is there a more elegant way to solve this problem? Obviously when dealing with multiple lines and/or a large grid, this will become much more time intensive.