ABSTRACT
All modern computer-generated graphics are raster-based. Every image is represented as a two-dimensional array of points. Rasterization of an ideal mathematical shape should pick pixels which are close to the actual line and be considered as a connected set on the raster grid. One of the basic raster algorithms is Bresenheim’s algorithm for rasterizing a line segment. It was originally developed in 1962 to control digital plotters. Usually all objects in three dimensional-computer graphics are composed of triangles so the triangle rasterization is used very often. Rasterization of such a mesh should give no holes in the resulting pixel set. But it is also very undesirable to have duplicate pixels, i.e., when the same pixel is produced by rasterization of several non-overlapping triangles.
