Your JavaScript is Disabled, Please Enable

3 Dimension Line Scan Algorithm

Coordinates Input

Screen shot 2 of scan line

Screen shot 3 of scan line

Screen shot 4 of scan line

Screen shot 5 of scan line

      3 Dimension Line Scan is an algorithm for visible surface determination, in 3D computer graphics is the mini project in Rajiv Gandhi Institute of Technology for the subject of Computer Graphics(2011), that works on a row-by-row basis rather than a polygon-by-polygon or pixel-by-pixel basis. All of the polygons to be rendered are first sorted by the top z(depth of visibility from front surface) coordinate at which they first appear, then each row or scan line of the image is computed using the intersection of a scan line with the polygons on the front of the sorted list, while the sorted list is updated to discard no-longer-visible polygons as the active scan line is advanced down the picture.

      The main advantage of this method is that sorting vertices along the normal of the scanning plane reduces the number of comparisons between edges. Another advantage is that it is not necessary to translate the coordinates of all vertices from the main memory into the working memory—only vertices defining edges that intersect the current scan line need to be in active memory, and each vertex is read in only once.