Computer Graphics: Two- and Three-Dimensional Clipping.
AIR FORCE HUMAN RESOURCES LAB BROOKS AFB TEX
Pagination or Media Count:
A clipping algorithm is derived and both two- and three-dimensional implementations of it are discussed. The algorithm finds the proper intersection of a line with any convex planar, polygon or spacial polyhedron. By interpretation of the computed clipping coefficients, both interior and exterior clipping to a convex region can result. Finally, the implementation lends itself well to highly parallel execution which reduces execution time. Author
- Computer Programming and Software