play and relax: games for kids games
  Cut the knot: learn to enjoy mathematics
A math books store at a unique math study site. Learn to enjoy mathematics.
Google
Web CTK
Best sites for teachers
Sites for teachers
Sites for parents
Terms of use
Awards

Interactive Activities
CTK Exchange
CTK Insights - a blog

Games & Puzzles
What Is What
Arithmetic/Algebra
Geometry
Probability
Outline Mathematics
Make an Identity
Book Reviews
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
Visual Illusions
My Logo
Math Poll
Cut The Knot!
MSET99 Talk
Other Math sites
Front Page
Movie shortcuts
Personal info
Privacy Policy

Guest book
News sites

Recommend this site

Best sites for teachers
Sites for teachers
Sites for parents

Education & Parenting

Manifesto: what CTK is about Search CTK Buying a book is a commitment to learning Table of content Things you can find on CTK Chronology of updates Email to Cut The Knot Recommend this page

 

Pick's Theorem

Theorem

Let P be a lattice polygon. Assume there are I(P) lattice points in the interior of P, and B(P) lattice points on its boundary. Let A(P) denote the area of A. Then

A(P) = I(P) + B(P)/2 - 1

Proof

For every lattice point p in the interior or boundary of P, let ap denote the angle of visibility of P from p. For points in the interior of P, ap = 2. For points on the boundary other than vertices, ap = . For a vertex p, ap is just the internal angle of the polygon at that vertex. Let wp = ap/2, and introduce W(P) = wp, where the sum is taken over all lattice points either inside or on the boundary of P. Then

(1) W(P) = A(P)

The proof of (1) proceeds in three steps. Firstly, note that function W is additive. Combining two polygons that share a piece of boundary into one either replaces two boundary points with one interior point or, when the point remains a vertex, adds up the two internal angles at that vertex, one from each polygon.

Secondly, verify (1) for simple shapes: lattice rectangle (Case 1) with sides parallel to the grid lines, half lattice rectangle (Case 2), and arbitrary lattice triangle where we have to consider a couple of cases (Cases 3a-b.) Embed the triangle into the smallest possible rectangle from Case 1. Such a rectangle will naturally appear as a union of the given triangle and pieces from the two previous cases. Apply additivity.

Thirdly, show that every simple lattice polygon may be dissected into a union of lattice triangle (e.g., by its diagonals.)

Acquipped with (1), we have only to compute W(P). Let P has n vertices and define b = B(P) - n. The sum of internal angles of P is (n - 2)*. At all other boundary points p (whose number is b), ap = . Therefore, wp, where the sum is taken only over boundary points is (n - 2)/2 + b/2 = (n + b)/2 - 1 = B(P)/2 - 1. Adding the sum wp over the internal points which is simply I(P) completes the expression for W(A):

W(P) = I(P) + B(P)/2 - 1

This combined with (1) proves the theorem.

Copyright © 1996-2008 Alexander Bogomolny

29436731Page copy protected against web site content infringement by Copyscape


Search:
Keywords:


Latest on CTK Exchange
try this puzzle ?/?? + ?/?? + ?/? ...
Posted by albert1950
0 messages
07:05 AM, Jul-10-08

Monty Hall Problem
Posted by linkdon
72 messages
06:07 PM, Jul-24-08

Missing information
Posted by roboknight
2 messages
07:32 AM, Jun-22-08

Can You See The Patterns..?
Posted by wustvn
0 messages
10:08 AM, Jul-23-08

Mistake on the page (an aside, Be ...
Posted by Max
4 messages
10:28 AM, Feb-28-08

Central Limit Theorem proof problem
Posted by Manuel
1 messages
01:54 PM, Jul-22-08

You can drill a square hole
Posted by Giorgis
1 messages
10:15 PM, Jul-12-08