polygon filling algorithm

General Pivot Point Rotation or Rotation about Fixed Point: For it first of all rotate function is used. Sequences of steps are…

Sutherland-Hodgeman Polygon Clipping: It is performed by processing the boundary of polygon against each window corner or edge. First of all entire…

Weiler-Atherton Polygon Clipping: When the clipped polygons have two or more separate sections, then it is the concave polygon handled by this…

Computer Graphics Tutorial It is difficult to display an image of any size on the computer screen. This method is simplified by…

Computer Graphics Window to Viewport Co-ordinate Transformation Once object description has been transmitted to the viewing reference frame, we choose the window…

Computer Graphics Window: The method of selecting and enlarging a portion of a drawing is called windowing. The area chosen for this…

Z-Buffer Algorithm It is also called a Depth Buffer Algorithm. Depth buffer algorithm is simplest image space algorithm. For each pixel on…

Computer Graphics Zooming Zooming is a transformation often provided with an imaginary software. The transformation effectively scales down or blows up 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…