7. Elementary polygon algorithms

a. Point in polygon: ray crossing parity
b. Winding number: sum of signed ray crossings
c. Alexander numbering
d. Fast and Loose / The Endless Chain
e. Gauss's "shoelace" algorithm for polygon area
f. Relating signed area and winding numbers of non-simple polygons