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.
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.
Computer Graphics - Lab assignments
Computer Graphics built using Win32 Desktop Applications with C . Depends on input taken from mouse clicks. Building computer graphics from scratch using mathematical equations and problem solving with C . Implementing the most famous computer graphics algorithms from scratch.
Computer Graphics algorithms for line drawing, shape filling, circle drawing, ellipse drawing, polygon clipping, shear, transformation, and reflection
A C and WPF implementation of Computer-Graphics-Principles And Practice by JOHN F. HUGHES, ANDRIES VAN DAM, MORGAN MCGUIRE, DAVID F. SKLAR, JAMES D. FOLEY, STEVEN K. FEINER and KURT AKELEY
An implementation of the Sutherland–Hodgman algorithm used for clipping polygons in C
Trabalho sobre Recorte desenvolvido durante a disciplina de Computação Gráfica 2015.2 do curso de Ciência da Computação da Universidade Federal de Roraima
A 3D model visualization system that implements a hierarchy system for each model transformation, lighting and sutherland-hodgman polygon clipping algorithm. Everything is deeply commented so it can be easily used as a resource for learning.
cs221
A repository for the OpenGL project of the Computer Graphics and Interaction Systems course @cse.uoi.gr
This repository contains some of the experiments that are covered in Computer Graphics Lab.
Image Processing algorithm
Add a description, image, and links to the sutherland-hodgman-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the sutherland-hodgman-algorithm topic, visit your repo's landing page and select "manage topics."