title: Is there a performant/mathematical way to find which tiles on a grid that a rotated rectangle overlaps?
body: <p>I'm trying to work out which tiles a rectangle overlaps.
  Right now I'm just taking the mix/max bounds of the rect, and iterating through the grid tiles that are within those bounds. And for each tile I check whether the tile rectangle intersects with the other rectangle. This isn't very performant as I still have to iterate a lot of tiles and do a lot of intersection checks.</p>
  
  <p>I'm wondering if theres a more performant or mathematical way to achieve this.</p>
  
  <p><a href="https://i.stack.imgur.com/L4mBe.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/L4mBe.png" alt="enter image description here"></a></p>