Lesson
The theory — Pick's Theorem: Area by Counting Points
A lattice polygon is a simple polygon whose corners are points of the square grid with integer coordinates. Pick's theorem says its area is A = I + B ÷ 2 − 1, where I is the number of grid points strictly inside and B the number on its edges, corners included. An edge from one grid point to another passes through gcd(|Δx|, |Δy|) grid steps, so B is the sum of those over the edges. A polygon with h holes has A = I + B ÷ 2 + h − 1, with the holes' edges counted in B.
What each symbol means
I- the grid points strictly inside the polygon
B- the grid points on its edges, corners included. Each edge contributes gcd(|Δx|, |Δy|)
A- the area, in grid squares. Always a multiple of ½
h- the number of holes. Each adds one to the formula
Problem solved in full
-
The area of a square, by counting 5 steps
A square has corners at (2, 2), (6, 2), (6, 6) and (2, 6). Find its area by counting grid points with Pick's theorem, check it with the shoelace formula, and say what the counts become when the square is doubled. Press Square to check.
-
Each edge runs 4 units along a grid line, so it has gcd(4, 0) = 4 steps, and the boundary count is:
-
The points strictly inside form a 3 by 3 block:
-
Pick's theorem:
-
The shoelace formula from the corners, for comparison:
-
Doubled, the square is 8 by 8, with 7 by 7 points inside and 32 on the edges:
Answer
The area is 16 by counting and 16 by coordinates. Doubled, the counts are 49 inside and 32 on the edges, and the area is 64, four times as much. The boundary count only doubled, so to make the area four times as large the interior count had to grow faster, from 9 to 49: a doubled polygon always has 4I + B − 3 points inside.
-