Anyone have a simple algorithm for this? No need for rotation or anything. Just finding if a line segment made from two points intersects a square
You can do this by casting a vector and counting the number of edges it crosses.
If the edges it crosses are even, it is outside the object, if the edges it crosses are odd, it is inside.
This works for all closed polygons.