network profile
| bio | website | google.com |
|---|---|---|
| location | Chapel Hill, NC | |
| age | 24 | |
| visits | member for | 1 year, 8 months |
| seen | Apr 25 at 17:20 | |
| stats | profile views | 2 |
Graduated in Dec 2009, currently working as a Web Application Developer.
|
Nov 30 |
awarded | Scholar |
|
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! |
|
Nov 30 |
accepted | Finding a Sicherman Trio of dice |
|
Nov 30 |
asked | Finding a Sicherman Trio of dice |
|
Jun 4 |
awarded | Supporter |
|
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. |
|
Sep 13 |
awarded | Student |
|
Sep 13 |
asked | Cover a polygon using a minimal set of rectangles |
|
Sep 13 |
awarded | Autobiographer |
