Disadvantages of sutherland hodgman polygon clipping algorithm
Answers
Answered by
28
The Sutherland - Hodgman algorithm is used for clipping polygons. It works by extending each line of the convex clip polygon in turn and selecting only vertices from the subject polygon that are on the visible side.
The disadvantages of using this algorithm is -
1. It clips to each window boundary one at a time.
2. It has a “Random” edge choice
3. It has Redundant edge-line cross calculations
The disadvantages of using this algorithm is -
1. It clips to each window boundary one at a time.
2. It has a “Random” edge choice
3. It has Redundant edge-line cross calculations
Similar questions