$\newenvironment {prompt}{}{} \newcommand {\ungraded }[0]{} \newcommand {\inputGif }[1]{The gif ‘‘#1" would be inserted here when publishing online. } \newcommand {\todo }[0]{} \newcommand {\oiint }[0]{{\large \bigcirc }\kern -1.56em\iint } \newcommand {\mooculus }[0]{\textsf {\textbf {MOOC}\textnormal {\textsf {ULUS}}}} \newcommand {\npnoround }[0]{\nprounddigits {-1}} \newcommand {\npnoroundexp }[0]{\nproundexpdigits {-1}} \newcommand {\npunitcommand }[1]{\ensuremath {\mathrm {#1}}} \newcommand {\RR }[0]{\mathbb R} \newcommand {\R }[0]{\mathbb R} \newcommand {\N }[0]{\mathbb N} \newcommand {\Z }[0]{\mathbb Z} \newcommand {\sagemath }[0]{\textsf {SageMath}} \newcommand {\d }[0]{\mathop {}\!d} \newcommand {\l }[0]{\ell } \newcommand {\ddx }[0]{\frac {d}{\d x}} \newcommand {\zeroOverZero }[0]{\ensuremath {\boldsymbol {\tfrac {0}{0}}}} \newcommand {\inftyOverInfty }[0]{\ensuremath {\boldsymbol {\tfrac {\infty }{\infty }}}} \newcommand {\zeroOverInfty }[0]{\ensuremath {\boldsymbol {\tfrac {0}{\infty }}}} \newcommand {\zeroTimesInfty }[0]{\ensuremath {\small \boldsymbol {0\cdot \infty }}} \newcommand {\inftyMinusInfty }[0]{\ensuremath {\small \boldsymbol {\infty -\infty }}} \newcommand {\oneToInfty }[0]{\ensuremath {\boldsymbol {1^\infty }}} \newcommand {\zeroToZero }[0]{\ensuremath {\boldsymbol {0^0}}} \newcommand {\inftyToZero }[0]{\ensuremath {\boldsymbol {\infty ^0}}} \newcommand {\numOverZero }[0]{\ensuremath {\boldsymbol {\tfrac {\#}{0}}}} \newcommand {\dfn }[0]{\textbf } \newcommand {\unit }[0]{\mathop {}\!\mathrm } \newcommand {\eval }[1]{\bigg [ #1 \bigg ]} \newcommand {\seq }[1]{\left ( #1 \right )} \newcommand {\epsilon }[0]{\varepsilon } \newcommand {\phi }[0]{\varphi } \newcommand {\iff }[0]{\Leftrightarrow } \DeclareMathOperator {\arccot }{arccot} \DeclareMathOperator {\arcsec }{arcsec} \DeclareMathOperator {\arccsc }{arccsc} \DeclareMathOperator {\si }{Si} \DeclareMathOperator {\scal }{scal} \DeclareMathOperator {\sign }{sign} \newcommand {\arrowvec }[1]{{\overset {\rightharpoonup }{#1}}} \newcommand {\vec }[1]{{\overset {\boldsymbol {\rightharpoonup }}{\mathbf {#1}}}} \newcommand {\point }[1]{\left (#1\right )} \newcommand {\pt }[1]{\mathbf {#1}} \newcommand {\Lim }[2]{\lim _{\point {#1} \to \point {#2}}} \DeclareMathOperator {\proj }{\mathbf {proj}} \newcommand {\veci }[0]{{\boldsymbol {\hat {\imath }}}} \newcommand {\vecj }[0]{{\boldsymbol {\hat {\jmath }}}} \newcommand {\veck }[0]{{\boldsymbol {\hat {k}}}} \newcommand {\vecl }[0]{\vec {\boldsymbol {\l }}} \newcommand {\uvec }[1]{\mathbf {\hat {#1}}} \newcommand {\utan }[0]{\mathbf {\hat {t}}} \newcommand {\unormal }[0]{\mathbf {\hat {n}}} \newcommand {\ubinormal }[0]{\mathbf {\hat {b}}} \newcommand {\dotp }[0]{\bullet } \newcommand {\cross }[0]{\boldsymbol \times } \newcommand {\grad }[0]{\boldsymbol \nabla } \newcommand {\divergence }[0]{\grad \dotp } \newcommand {\curl }[0]{\grad \cross } \newcommand {\lto }[0]{\mathop {\longrightarrow \,}\limits } \newcommand {\bar }[0]{\overline } \newcommand {\surfaceColor }[0]{violet} \newcommand {\surfaceColorTwo }[0]{redyellow} \newcommand {\sliceColor }[0]{greenyellow} \newcommand {\vector }[1]{\left \langle #1\right \rangle } \newcommand {\sectionOutcomes }[0]{} \newcommand {\HyperFirstAtBeginDocument }[0]{\AtBeginDocument }$

A planimeter computes the area of a region by tracing the boundary.

Green’s Theorem may seem rather abstract, but as we will see, it is a fantastic tool for computing the areas of arbitrary bounded regions. In particular, Green’s Theorem is a theoretical planimeter. A planimeter is a “device” used for measuring the area of a region. Ideally, one would “trace” the border of a region, and the planimeter would tell you the area of the region.

### How is Green’s Theorem a planimeter?

Recall Green’s Theorem:

Given a vector field $\vec {F}:\R ^2\to \R ^2$, if $\curl \vec {F} = 1$, then the left-hand side of the conclusion of Green’s Theorem gives the area of the region $R$:

So now the question becomes, which vector fields have $\curl \vec {F} = 1$? Here are three basic candidates:

• $\vec {F}(x,y) = \vector {0,x}$
• $\vec {F}(x,y) = \vector {-y,0}$
• $\vec {F}(x,y) = \vector {-y/2,x/2}$
The key idea that connects the three vector fields above is:
Their curl is $1$. They are conservative fields. They are gradient fields. When used in combination with Green’s Theorem, they help compute area.

Once we have a vector field whose curl is $1$, we may then apply Green’s Theorem to use a line integral to compute the area.

### Computing areas with Green’s Theorem

Now let’s do some examples.

Finally, what do you do if you have a very strangely shaped curve? You approximate it with a polygonal curve. Check out next example.

Green’s Theorem gives a fairly easy method for computing any the area of any polygonal region. Any region with a “smooth” border can be approximated by a polygonal region. The upshot? Green’s Theorem is a powerful tool for computing area.

### The shoelace algorithm

Green’s Theorem can also be used to derive a simple (yet powerful!) algorithm (often called the “shoelace” algorithm) for computing areas. Here’s the idea: Suppose you have a two-dimensional polygon, where the vertices are identified by their $(x,y)$-coordinates:

Here we see a polygon with $n$ vertices, and the “dashed-line” means that there could be more to this polygon than “meets the eye.” So to compute the area, here is a neat trick. Write all of the coordinates in a column, writing the starting coordinate twice, both at the beginning and at the end:

Now multiply entries of the columns diagonally down from the left to the right and add them together

to obtain: Now, multiply entries of the columns diagonally down from the left to the right and subtract them from our previous sum to obtain:

The area of the polygon in question will be: The algorithm is called the “shoelace” algorithm because of the crisscrossing pattern you see above.

Compute the area of the following polygon: The area is $\answer {47}$ square units.

#### Why does the shoelace algorithm work?

Now we are going explain why the shoelace algorithm works via Green’s Theorem. The restrained young mathematician may protest that we are using a “crane to crush a fly,” but whatever. We like Green’s Theorem.

A student is working with a pentagon: and using the shoelace algorithm: computes the area of the pentagon as:

So the student concludes that the area is Is this correct?

Yes No