Computational geometry technique

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 broader sense computational geometry is concerned with the design and analysis of algorithms for solving geometric problems. In a deeper sense it is the study of the in- herent computational complexity of geometric problems under varying models of computation.