This repository contains codes, notes, question papers and question banks for Computer Graphics (CG) which is a subject of second year (SEM-3) SPPU syllabus.
Go to file
2023-11-23 12:23:20 +05:30
assignments assignment 1-7 added 2023-11-22 23:06:33 +05:30
lab-manual lab manual added 2023-10-28 01:06:38 +05:30
notes fixed naming and updated README 2023-11-05 20:59:07 +05:30
question-papers added end-sem question paper (november 2022) and updated readme index for end sem question papers 2023-10-29 23:25:36 +05:30
.gitignore Initial commit 2023-09-27 12:34:25 +05:30
CGL_Koch and Snowflake Curves.pdf Koch Algo notes from CGL added -shh_itsourlittlesecret 2023-11-04 23:12:35 +05:30
CohenSutherland(Using built-in).cpp fixed naming and updated README 2023-11-05 20:59:07 +05:30
CohenSutherland(UsingDDA).cpp cohensutherland code added 2023-10-28 01:19:18 +05:30
DDA-circle.cpp Added DDA for circle, line and triangle 2023-09-29 23:42:20 +05:30
DDA-line.cpp Added DDA for circle, line and triangle 2023-09-29 23:42:20 +05:30
DDA-triangle.cpp Added DDA for circle, line and triangle 2023-09-29 23:42:20 +05:30
HilbertCurve.cpp Hilbert curve added 2023-11-02 11:53:35 +05:30
Koch-Curve.cpp koch,snowflake,transformation added 2023-11-23 12:23:20 +05:30
README.md readme updated 2023-11-22 23:13:01 +05:30
Snowflake.cpp koch,snowflake,transformation added 2023-11-23 12:23:20 +05:30
Transformation.cpp koch,snowflake,transformation added 2023-11-23 12:23:20 +05:30

CG

This repository contains notes and codes for Computer Graphics.


Index

Lab Notes CGL

  1. Koch and Snowflake Algorithms

Lab Manual

Codes

Digital Differential Analyzer (DDA)

Digital Differential Analyzer (DDA) is a line-drawing algorithm for digital displays, using incremental calculations to plot points between endpoints.

  1. Line
  2. Triangle
  3. Circle

Cohen-Sutherland

  1. Cohen-Sutherland (Using Inbuilt Function)
  2. Cohen-Sutherland (Using DDA Line Drawing Algorithm)

Curves

  1. Hilbert's Curve

Notes

  1. Unit 1 - Graphics Primitives and Scan Conversion Algorithms
  2. Unit 2 - Polygon, Windowing and Clipping
  3. Unit 3 - 2D, 3D Transformations and Projections
  4. Unit 5 - Curves and Fractals

Question Papers

  1. IN-SEM
  2. END-SEM

Maintained by: