Find which tiles are intersected between two points on an isometric tilemap [duplicate]

Ask Question

Asked 11 months ago

Modified 11 months ago

Viewed 19 times

I need to be able to find out which tiles are intersected when a line is drawn between two points.

I'm currently working with a isometric perspective which makes things a little more complicated.

I've thought of simply checking every X pixels until target is reached by it would be very processing intensive.

I'm using Python and Pygame.

asked Jan 7 at 8:51

Zoler1337

135 bronze badges

\$\begingroup\$ You should find the coordinates of the start and end points on the target plane, and then use a line rasterization algorithm, such as Bresenham's line algorithm. \$\endgroup\$
– Mangata
Jan 7 at 10:25
\$\begingroup\$ No, doing this in isometric perspective is not more complicated, because the set of tiles crossed by a line in the world does not vary based on viewing perspective. You solve this problem in your game simulation world space, which is not rotated, then project the result to your rotated isometric view. \$\endgroup\$
– DMGregory ♦
Jan 7 at 12:26
\$\begingroup\$ Would a marching ant(bee) algorithm or en.wikipedia.org/wiki/Bresenham%27s_line_algorithm be over complicated? The math is straightforward whereas the deprojection, calculate, reproject, seems much more complicated. \$\endgroup\$
– user122973
Jan 8 at 5:53

Add a comment |

0