Computational geometry


 * Line Sweep Algorithms
 * Convex Hull
 * Closest Pair

There is a simple formula for the area of any polygon whose edges do not cross (a "simple" polygon), see Polygon. You can also determine if the polygon is clockwise or counterclockwise.

There is also a very simple area formula that works on 2D rectangular grids: Pick's_theorem