Added program of Sutherland-Hodgman algorithm #2063
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
The Sutherland-Hodgman algorithm is used for polygon clipping, a process in computer graphics where a polygon is clipped against a defined clipping window. This algorithm helps determine the part of the polygon that lies within the clipping area, usually a rectangular or convex polygonal window. Given a polygon with n vertices and a convex clipping window, the goal is to clip the polygon so that only the portion inside the window is retained. The algorithm iteratively clips the polygon edges against each edge of the clipping window, modifying the polygon by adding or removing vertices based on their positions relative to the window.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The Sutherland-Hodgman algorithm is used for polygon clipping, a process in computer graphics where a polygon is clipped against a defined clipping window. This algorithm helps determine the part of the polygon that lies within the clipping area, usually a rectangular or convex polygonal window.
Given a polygon with n vertices and a convex clipping window, the goal is to clip the polygon so that only the portion inside the window is retained. The algorithm iteratively clips the polygon edges against each edge of the clipping window, modifying the polygon by adding or removing vertices based on their positions relative to the window.