Write and explain cohen sutherland line clipping algorithm in computer graphics
Answers
Answered by
1
The Cohen–Sutherland algorithm is a computer-graphics algorithm used for line clipping. The algorithm divides a two-dimensional space into 9 regions and then efficiently determines the lines and portions of lines that are visible in the central region of interest (the viewport).
The algorithm was developed in 1967 during flight-simulator work by Danny Cohen and Ivan Sutherland.
An outcode is computed for each of the two points in the line. The outcode will have 4 bits for two-dimensional clipping, or 6 bits in the three-dimensional case. The first bit is set to 1 if the point is above the viewport. The bits in the 2D outcode represent: top, bottom, right, left. For example, the outcode 1010 represents a point that is top-right of the viewport.
Hope this helps you. ..
@KHUSHALI. .
The algorithm was developed in 1967 during flight-simulator work by Danny Cohen and Ivan Sutherland.
An outcode is computed for each of the two points in the line. The outcode will have 4 bits for two-dimensional clipping, or 6 bits in the three-dimensional case. The first bit is set to 1 if the point is above the viewport. The bits in the 2D outcode represent: top, bottom, right, left. For example, the outcode 1010 represents a point that is top-right of the viewport.
Hope this helps you. ..
@KHUSHALI. .
Anonymous:
If you like this plz mark this as brainliest answer.
Similar questions