Timeline for Triangulations of lattice polygons
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 25, 2013 at 3:02 | review | Late answers | |||
| Jun 26, 2013 at 11:36 | |||||
| Apr 19, 2012 at 12:35 | comment | added | Rick Walcott | I can't argue with i=0, b=3, A=1. I should have tested this. | |
| Apr 19, 2012 at 12:27 | comment | added | Rick Walcott | I would think it's -2 except that this can be compared to Euler's polyhedral formula F+V=E+2, flattened to 2D, and F has to include the one face outside the bounded figure. A+1=F | |
| Apr 19, 2012 at 12:23 | history | edited | Rick Walcott | CC BY-SA 3.0 |
added a formula for non-integer areas
|
| Apr 19, 2012 at 12:22 | comment | added | Gerry Myerson | I think that's $2i+b-2$. For a single triangle, $i=0$, $b=3$, $A=1$. | |
| Apr 19, 2012 at 12:07 | history | answered | Rick Walcott | CC BY-SA 3.0 |