Difference between mid point subdivision line clipping algorithm and cohen sutherland line clipping algorithm
Answers
Answered by
0
Answer:
The strength of this algorithm over the Cohen-Sutherland algorithm is that it requires no floating point arithmetic to find the point of intersection with the line and the clip boundary. If it is, then P1 is the farthest point from P0 and the process is complete; otherwise, it is invisible, continue.
Similar questions