Question

Difference between cohen sutherland and midpoint subdivision algorithm for line clipping

Answer 1

Cohen sutherland algorithm: It is a computer graphic algorithm that is used for line clipping. The 9 divisions from the two dimensional space makes effective determination of the areas of interest.

Midpoint subdivision algorithm: An alteration of Cyrus beck algorithm that uses the midpoint of the lines to effectively identify the areas of interest.

Difference:

• The midpoint subdivision algorithm does not require any floating point operation to determine the point of intersection.
• This reduces the complexity of the algorithm and hence increases the speed of the algorithm.
• The accuracy is also higher in midpoint subdivision algorithm when compared to Cohen sutherland algorithm.

Answer 2

Difference between cohen sutherland and midpoint subdivision algorithm for line clipping :

The Cohen - Sutherland algorithm:

• The Cohen - Sutherland algorithm divides 2D space into 9 bits, using an infinite extension of the four linear limits of the frame.
• This seems to 'calculate intersections' along a 'line path', and each calculation involves both a 'division and a multiplication'.

The Midpoint subdivision algorithm:

• The 'Midpoint subdivision algorithm' is mainly used to calculate the visible area of the line that is 'present in the view port' of the 'sector or the image'.
• It takes the principle of the bisection technique by bisecting the line into equivalent division. 'Midpoint Subdivision Algorithm' bisects the line many times.

To know more

Write and explain cohen sutherland line clipping algorithm in computer graphics

https://brainly.in/question/3331749

Explain cohen sutherland line clipping algorithm in cg

https://brainly.in/question/4047361