Posts

Showing posts from October 11, 2020

New Post

Nicholl - Lee Nicholl (NLN) Line Clipping in Computer Graphics

Image
 In the Cohen-Sutherland method, multiple intersections may be calculated along the path of a single line before an intersection on the clipping rectangle or line is completely rejected.  In Nicholl - Lee Nicholl Line Clipping, Extra intersection calculations are eliminated.  ADVANTAGE OF Nicholl - Lee Nicholl (NLN) Line Clipping 1.) The  number of clipping points is reduced to one, compared to other algorithms that may require two or more clipping.  2.)  Nicholl - Lee Nicholl (NLN) Line Clipping is FAST. Clipping algorithms for Circle, Curved boundary clipping regions are SLOWER because intersections calculations involve nonlinear curve equations.  3.)    Nicholl - Lee Nicholl (NLN) Line Clipping avoids multiple clipping of Line segments.  4.) As Compare to Cohen Sutherland and Liang-Barsy  Nicholl - Lee Nicholl Line Clipping performed fewer comparisons.    How Nicholl - Lee Nicholl Line Clipping works?  Nicholl - Lee Nicholl Line Clipping, uses symmetry to categorize endpoints into o
More posts