A New Clipping Algorithm for Line Segments

Tang Jingli · 1992

In this paper, a new clipping algorithm for line segments with a rectangular window is presented and its correctness is proved. The visibility of a line segment can be determined simply by the two criterions. The main advanteges of the algorithm are the simplicity for programmind and the comprehensive suitability for computing.

Read the paper · More papers on PaperTik