[CST-1b] DSA 98.3.5

[Nathan Dimmock]

DSA 98.3.5 (a) - Describe an algorithm to discover whether a point is
inside a simple plane closed polygon.

Am I right in thinking that he didn't lecture on this algorithm,
therefore making it unexaminable this year?  If not, (or generally for
interest/sanity) anyone care to point me to a description of it in the
MIT book please? (since I can't seem to find any reference to it!)
-- 
Nathan 
Jesus College, Cambridge, CB5 8BL
http://www-jcsu.jesus.cam.ac.uk/~ned21/