Cohen Sutherland Method for Line Clipping Example ~xRay Pixy

Cohen Sutherland Method for Line Clipping

Computer Graphics is a Branch of Computer Science that deals with generating images with the help of computers. The major use of computer graphics is in Design Processes. For example, Engineering and Architectural Systems. Computer-Aided design methods are now used in the design of buildings, automobiles, aircraft, spacecraft, and many other. The major application area is Presentation Graphics (used in presentations) Examples of presentation graphics are bar charts, line graphs, surface graphs, pie charts. 

Requirements of Line drawing Algorithm. The line should appear as a Straight line. It should be started and end accurately. Commonly used line drawing algorithms are DDA and Bresenahems.

Bresenham's Line Drawing Algorithm:  The algorithm developed by Bresenham is more accurate and efficient as compared to DDA. Brenham algorithm uses only integer additions,  subtraction, and multiplication. The basic principle of Bresenham’s line algorithm is to find the optimum raster locations to represent the straight line. Starting from the left endpoint (x0, y0) of the given line.

Cohen–Sutherland algorithm

Explain cohen Sutherland line clipping algorithm in detail
Liang Barsky Method
Nicholl Lee Nicholl Method
What is a line clipping algorithm?
What are line clipping and polygon clipping?
Why clipping algorithm is required?
What are clipping and examples?
Line Clipping