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.
A bunch of different graphics algorithms implemented in c++
This is my AMIGA/PC Raycaster project. The main engine files are OS independent, so it can be easly adapted to OS that uses RGBA buffer rendering.
Code Repository for Computer Graphics Theory and Sessional!
Various Computer Graphics Algorithms
Computer Graphics algorithms for line drawing, shape filling, circle drawing, ellipse drawing, polygon clipping, shear, transformation, and reflection
An implementation of the Sutherland–Hodgman algorithm used for clipping polygons in C
Simple software rendering
Generates the Teesside Programming Club logo using Sutherland-Hodgman clipping.
A C++ program to clip and fill 2D polygons with a convex window
Determining the cut of any given polygon and a pyramid
Computer graphics project that includes rasterising lines and polygones with interactive GUI that enables filling the polygons and cropping objects.
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."