What is computational geometry?
For more descriptions of these and other applications of computational geometry, see my web site “Geometry in Action”. Today’s lecture will describe algorithms for two simple geometric problems: determining whether a point is in a polygon, and finding convex hulls. Next quarter I will be offering ICS 164, a class devoted entirely to geometric algorithms, in which I’ll describe some more algorithms and applications, for instance the binary space partitions used by Doom.
