Geometry
The segment intersection test decides whether two segments share at least one point, using the signs of four cross products, with no division. It answers yes or no; to find the common point itself, use lines and segments.
The shoelace formula finds the exact area of a polygon from its corners, listed in order around it, by adding one cross product per side. If the corners come as an unordered set of points, build the convex hull first.
The convex hull of a set of points is the smallest convex polygon that contains all of them. The monotone chain algorithm finds its corners in order in O(n \log n) time, using only the sign of a cross product. For the dynamic programming technique with a similar name, see the convex hull trick.
Basic contest geometry answers questions about two or three points with integer coordinates, such as which way three points turn or what kind of angle they make, by the sign of a cross product or a dot product of vectors. The sign of an integer is exact, unlike slopes or angles in floating point.