Computer Engineering is coming soon

We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.

Computer Engineering

Computer Graphics

Line and circle drawing, filling, clipping, 2D and 3D transformations, projections.

Interview questions
Your progress in this subject0 of 14 · 0%
  1. 1Graphics primitives and display devicesOverview of graphics primitives (points, lines, polygons, curves) and display devices (raster-scan, random-scan, LCD/OLED), with definitions, key formulas (frame-buffer size, pixel clock, PPI), worked numerical examples, common exam mistakes and quick self-test.
  2. 2Line drawing: DDA and Bresenham's algorithmsDDA and Bresenham are two basic raster line-drawing algorithms used to convert a straight mathematical line into discrete pixel coordinates for raster displays.
  3. 3Circle drawing: DDA, Bresenham and midpoint algorithmsClear, exam-focused notes on circle drawing algorithms: DDA (parametric), midpoint and Bresenham, with definitions, derivations, formulas, diagram instructions, two C++ programs (midpoint and Bresenham), worked steps, common mistakes and quick checks.
  4. 4Polygons and the inside testHow to decide whether a point lies inside, outside or on the boundary of a polygon: definitions, theorems, the even-odd (ray-casting) and winding-number rules, half-plane test for convex polygons, point-in-triangle by barycentric coordinates, formulas, algorithms and a working C++ implementation.
  5. 5Polygon filling: flood fill, seed fill and scan-line fillClear, exam-focused notes on polygon filling: flood/seed-fill (recursive and non-recursive) and scan-line fill, with definitions, derivations, formulas, worked examples (including a runnable C++ flood-fill), common mistakes and quick self-test.
  6. 6Windowing and the viewing transformationHow to select a 2D/3D viewing window, build the viewing (camera) transform, and map the canonical view to a display viewport (including the math and examples).
  7. 7Line clipping: Cohen–Sutherland algorithmCohen–Sutherland is a fast line-clipping algorithm that uses 4-bit region codes (outcodes) to trivially accept or reject line segments against an axis-aligned rectangular window and iteratively computes intersections when necessary.
  8. 8Polygon clipping: Sutherland–Hodgeman algorithmSutherland–Hodgeman clips a polygon against a convex clipping region (commonly a rectangle) by iteratively clipping against each clip edge and producing a new polygon.
  9. 92D transformations2D transformations: how points and shapes are moved, scaled, rotated, reflected and sheared in a plane using linear algebra and homogeneous coordinates, and how to compose and invert these operations.
  10. 10Rotation about an arbitrary pointHow to rotate 2D points, shapes or coordinates about any chosen pivot by translating to the origin, applying the rotation matrix, and translating back — using homogeneous 3×3 matrices for composition.
  11. 113D transformationsClear, exam-focused notes on 3D transformations: definitions, matrix forms in homogeneous coordinates, composition, inverses, axis-angle rotation (Rodrigues), worked numerical examples, common mistakes and exam guidance.
  12. 12Rotation about an arbitrary axisRotation about an arbitrary axis: how to rotate a 3D point or object around any straight line using translation + rotation or Rodrigues' formula, with derivation, formulas and worked numerical examples.
  13. 13Parallel projectionsParallel projection maps 3D points to a plane using parallel projection rays; common types are orthographic (perpendicular) and oblique (slanted), and we implement them with simple formulas or 4×4 homogeneous matrices after an appropriate view transform.
  14. 14Perspective projection and vanishing pointsNotes on the pinhole (perspective) projection model: how 3D points map to a 2D image plane, the projection matrix, and how parallel lines produce vanishing points and the horizon line.

Coming next in Computer Graphics

  1. Anti-aliasing and character generation· notes coming
  2. Interactive input devices· notes coming
  3. Line clipping: Cyrus–Beck, midpoint subdivision and Liang–Barsky· notes coming
  4. Hidden surface removal: back-face, z-buffer and painter's algorithms· notes coming
  5. Curved surfaces and solids by sweep· notes coming
  6. Graphics standards and tools: OpenGL and DirectX· notes coming
  7. Computer animation· notes coming
  8. Halftoning and dithering· notes coming
  9. Parametric curves and interpolation· notes coming
  10. Bézier curves· notes coming
  11. B-spline curves· notes coming
  12. Fractals: Koch snowflake and Hilbert curve· notes coming