Which of the following technique is used for Clipping?

Answer: Cohen–Sutherland line-clipping algorithm

Why this is correct: Cohen–Sutherland is a standard line-clipping technique used to clip line segments to a rectangular viewing window. It is efficient because it quickly identifies trivially accepted or rejected lines using region codes and only computes intersections when necessary.

• Compute a 4-bit region code for each endpoint indicating position relative to the clip rectangle (left, right, top, bottom).

• If both region codes are 0000, the entire line lies inside the window: accept it.

• If the bitwise AND of the two region codes is nonzero, the line lies entirely outside on the same side: reject it.

• Otherwise, select an endpoint outside the window, compute its intersection with the appropriate clip boundary, replace the endpoint with the intersection point, recompute its region code, and repeat until the line is accepted or rejected.

Related notes: Other common clipping methods include Liang–Barsky (parametric and often more efficient for line clipping), Sutherland–Hodgman (polygon clipping), and Cyrus–Beck (parametric clipping for convex polygons). The other choices in the question refer to filling methods or transformations: stack-based seed and scan-line seed are polygon filling approaches, and inverse scaling is a geometric transformation, not a clipping technique.