diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md index c3b671bf5a5..b4cd4801088 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md @@ -8,7 +8,7 @@ dashedName: sutherland-hodgman-polygon-clipping # --description-- -The [Sutherland-Hodgman clipping algorithm]() finds the polygon that is the intersection between an arbitrary polygon (the "subject polygon") and a convex polygon (the "clip polygon"). It is used in computer graphics (especially 2D graphics) to reduce the complexity of a scene being displayed by eliminating parts of a polygon that do not need to be displayed. Take the closed polygon defined by the points: +The Sutherland-Hodgman clipping algorithm finds the polygon that is the intersection between an arbitrary polygon (the "subject polygon") and a convex polygon (the "clip polygon"). It is used in computer graphics (especially 2D graphics) to reduce the complexity of a scene being displayed by eliminating parts of a polygon that do not need to be displayed. Take the closed polygon defined by the points: 
[(50, 150), (200, 50), (350, 150), (350, 300), (250, 300), (200, 250), (150, 350), (100, 250), (100, 200)]