Triangulations of lattice polygons Let L be a 2-dimensional lattice and P- a lattice polygon. Suppose, it is triangulated into lattice tiangles. What are restrictions on their areas? For instance, can a lattice triangle of even area always be divided into lattice triangles of area 1? Is there any general approach to such questions? 
 A: By Pick's Theorem, the area of a lattice polytope is related to the number $i$ of lattice points in the interior and the number $b$ of lattice points on the boundary, according to the formula:
$$A = i + \frac{b}{2} - 1$$
Note that if $b$ is odd, then the area must be equivalent to $1/2$ mod $1$.  This implies that any lattice triangle with integral area has at least one non-vertex point located on an edge.  That extra point can be used to subdivide the triangle into two smaller lattice triangles.
Concerning the splitting of even area triangles into triangles of area 1, I don't know any general results.
Hope this helps!
A: This is not my own formula:
A = 2i + b - 1 when the area of one triangle is 1.
I haven't tested this, but I think it works on any triangular grid (not just equilateral).
I did test A=sqrt(3)*(i+b/2-1)/2 on an equilateral triangle grid.
This works because each square can be mapped to a parallelogram comprised of 2 equilateral triangles, and the area of the parallelogram is sqrt(3)/2.
A: I tested A = 2i + b - 2 for any triangular lattice where A = 1 for each triangle, and it works. Geometer's Sketchpad implements it very nicely, but it would work in GeoGebra too.
