Generalized two- and three-dimensional clipping

Abstract This paper derives a clipping algorithm and discusses both two- and three-dimensional implementations of the algorithm. The algorithm finds the proper intersection of a line with any convex planar, polygon or spacial polyhedron. Interpretation of the computed clipping coefficients can produce both interior and exterior clipping to a convex region. Finally, the implementation lends itself well to highly parallel excution which reduces execution time.