Line

1. DDA Line Algorithm: DDA stands for Digital Differential Analyzer. It is an incremental method of scan conversion of line. In this method, the calculation is performed at each step but by using the results of previous steps.
2. Bresenham's Line Algorithm: This algorithm is used for scan converting a line. It was developed by Bresenham. It is an efficient method because it involves only integer addition, subtractions, and multiplication operations. These operations can be performed very rapidly so lines can be generated quickly.

Circle

1. Midpoint Circle Algorithm: It is based on the following function for testing the spatial relationship between the arbitrary point (x, y) and a circle of radius r centered at the origin.
2. 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 made only in the +x & -y directions.

Ellipse

1. Midpoint Ellipse Algorithm: This is an incremental method for scan converting an ellipse that is centered at the origin in standard position i.e., with the major and minor axis parallel to coordinate system axis. It is very similar to the midpoint circle algorithm. Because of the four-way symmetry property we need to consider the entire elliptical curve in the first quadrant.