Computational geometry methodology

A method for solving a wide range of geometric problems, including computing the intersection of two lines or planes and triangulating a polygon. The algorithm works by sweeping a line or plane across the geometry and updating a data structure as it goes.

In a narrow sense computational geometry is concerned with computing geometric properties of sets of geometric objects in space such as the simple above/below relationship of a given point with re- spect to a given line.