Faster than light refactor

[ChrisVilches]

Try doing just one intersection check, but rotate it 4 times. Does it work?

Maybe some rotations aren't useful, so it'd be wasted work.

[ChrisVilches]

I think this is already done. Check again.

  // TWO ROTATIONS
  for (int rot = 0; rot < 2; rot++) {
    vector<Point> top_right, bottom_left;

    for (const Rectangle r : rectangles) {
      bottom_left.push_back(r.bottom_left());
      top_right.push_back(r.top_right());
    }
    // THE INTERSECTION CHECK IS HERE
    if (!intersection(top_right, bottom_left)) {
      return true;
    }

    // THE ROTATION
    for (Rectangle& r : rectangles) r = r.rot_ccw();
  }