Computer Graphics Tutorial

Filled Area Primitives: Region filling is the process of filling image or region. Filling can be of boundary or interior region as…

Gouraud shading This Intensity-Interpolation scheme, developed by Gouraud and usually referred to as Gouraud Shading, renders a polygon surface by linear interpolating…

Perspective Projection In perspective projection farther away object from the viewer, small it appears. This property of projection gives an idea about…

Scan Line Algorithm It is an image space algorithm. It processes one line at a time rather than one pixel at a…

Bresenham’s Circle Algorithm: Scan-Converting a circle using Bresenham’s algorithm works as follows: Points are generated from 90° to 45°, moves will be…

Hidden Surface Removal One of the most challenging problems in computer graphics is the removal of hidden parts from images of solid…

Three Dimensional Graphics The three-dimensional transformations are extensions of two-dimensional transformation. In 2D two coordinates are used, i.e., x and y whereas…

Bresenham’s Line Algorithm This algorithm is used for scan converting a line. It was developed by Bresenham. It is an efficient method…

Homogeneous Coordinates The rotation of a point, straight line or an entire image on the screen, about a point other than origin,…

Plotters Plotters are a special type of output device. It is suitable for applications: Architectural plan of the building. CAD applications like…