Reputation
Next privilege 125 Rep.
Vote down
Badges
4
Newest
 Scholar
Impact
~386 people reached

  • 0 posts edited
  • 0 helpful flags
  • 6 votes cast
Nov
30
comment Finding a Sicherman Trio of dice
Ah, I was staring right at it too. I understand your comment now. That makes it easy to find additional sets. Thanks!
Sep
19
comment Cover a polygon using a minimal set of rectangles
@hardmath Yes, the rectangle's vertices lie on the grid. I ended up just finding the bounding rectangle for the polygon, tiling the covering rectangles over that bounding rectangle, and then discarding any covering rectangles that didn't intersect or lie within the polygon.
Sep
14
comment Cover a polygon using a minimal set of rectangles
@Joseph I know I can use a greedy approximation for sets of elements, but I'm not sure how to extend it to polygon coverings.