A differentiable Python implementation of the Sutherland–Hodgman algorithm for clipping polygons in 2D.
-
Updated
Aug 12, 2022 - Python
A differentiable Python implementation of the Sutherland–Hodgman algorithm for clipping polygons in 2D.
Various Computer Graphics Algorithms
Generates the Teesside Programming Club logo using Sutherland-Hodgman clipping.
Add a description, image, and links to the sutherland-hodgman topic page so that developers can more easily learn about it.
To associate your repository with the sutherland-hodgman topic, visit your repo's landing page and select "manage topics."