compare cohen--sutherland and nicholl lee nicholl line clipping algorithm

In Cohen-Sutherland line clipping sometimes multiple calculation of intersection point of a line is done before actual window boundary intersection. Introduction: By creating more regions around the clip window, the Nicholl-Lee-Nicholl (or NLN) algorithm avoids multiple clipping of an individual line Clipping algorithms are designed to efficiently identify the portions of a scene (in viewing coordinates) that lie inside a given viewport. They are. Defining the line for clipping with the Liang-Barsky algorithm. the Cohen-Sutherland algorithm. The clipping window is divided into a number of different areas, The Liang-Barsky algorithm will actually compute all the parameter values corresponding to the intersection of the line with the window. Avoiding many of these