I am interested in Pick Theorem.
Pick Theorem Assume $P$ is a convex lattice point polygon. If $B$ is the number of vertexes of $P$ and $I$ is the number of lattice points which in the interior of $P$. Then the area of $P$ is $I+\frac{B}{2}-1$.
I find this theorem in a magazine. It provides a proof based on Minkowski Theorem. At first, I think the method may be too difficult and I could find an easy one. But I failed. So I want to ask is there any other proof here?
Also, this problem may not be easy as it looks like. I think it may be related to the Euler number of graph, because Pick Theorem is similar to the two dimensional surface version of Euler character. So there is another question what is the relationship between Pick Theorem and Euler character.
In addition, is there an approach to make it into higher dimension? I have know idea because if you imagine a convex lattice point polyhedron, you will find that its area is not a rational number like the version above. So maybe we should generalize it from another way.