In Weiler Atherton Clipping Algorithm which of the following is consider to clip a polygon?

In Weiler Atherton Clipping Algorithm which of the following is consider to clip a polygon? Correct Answer Window boundaries

In the Weiler Atherton algorithm, we consider the view pane boundaries instead of edges and vertices of the polygon to clip a polygon. Points very close to the edge of the other polygon may be considered as both in and out until their status can be confirmed after all the intersections have been found and verified but this increases the complexity.
Bissoy MCQ

Related Questions

Which of the following polygon clipping algorithm can be used to clip a filled area?
Vatti Clipping Algorithm uses the sweep line approach to clip a polygon.
If the subject polygon is concave at vertices outside the clipping polygon, the new polygon may have coincident edges.
Which of the following part of a polygon is considered in a polygon clipping algorithm?
Fast clipping algorithm is an example of ____________ clipping algorithm.
Greiner Hormann Clipping Algorithm is more efficient than the Vatti Clipping Algorithm.
In polygon clipping, line clipping algorithms can be used.
We can correctly clip a polygon by processing the polygon boundary as a whole against each ___________
Which vertex of the polygon is clipped first in polygon clipping?
Cohen Sutherland clipping algorithm computes _______ number of intersections than NLN line clipping.