Difference between cohen sutherland and cyrus beck line clipping algorithms
Answers
Answered by
0
hiii
plzzz mark me as brainliest
The Cohen Sutherland Algorithm is a computer graphics algorithm used for line clipping. It divides two dimensional space into nine regions and then efficiently determines the lines and portions of lines that are visible in the region of interest.
The Cyrus Beck Algorithm is the generalized line clipping algorithm .It was designed to be more efficient then the Cohen Sutherland Algorithm which uses repetitive clipping. Cyrus Beck is a general algorithm and can be used with a convex polygon clipping window unlike Cohen Sutherland Algorithm which can be used only on a rectangular clipping area.
plzzz mark me as brainliest
The Cohen Sutherland Algorithm is a computer graphics algorithm used for line clipping. It divides two dimensional space into nine regions and then efficiently determines the lines and portions of lines that are visible in the region of interest.
The Cyrus Beck Algorithm is the generalized line clipping algorithm .It was designed to be more efficient then the Cohen Sutherland Algorithm which uses repetitive clipping. Cyrus Beck is a general algorithm and can be used with a convex polygon clipping window unlike Cohen Sutherland Algorithm which can be used only on a rectangular clipping area.
Similar questions