Line generation algorithms - graphic primitives, Computer Graphics

Line Generation Algorithms - Graphic Primitives

In previous section we have discussed the case of frame buffer, here information regarding the image to be projected upon the screen is accumulated in an m*n matrix, in the form of 0s and 1s; the 1s stored in an m* n matrix locations are brightened upon the display and 0's are not brightened on the display and this section that may or may not be brightened is termed as the Pixel i.e. picture element. This information of 0s and 1s offers the needed pattern on the output screen that is for display of information. In that a buffer, the screen is also in the form of m* n matrix, here all sections or niche is a pixel that is we have m* n pixels to constitute the output.

1184_Line Generation Algorithms - Graphic Primitives.png

Figure: Basic Line Generation

Here, it is to be noticed that the creation of a line is merely not restricted to the above pattern, since occasionally the line may have a slope and intercept which its information is needed to be stored in more than one part or section of the frame buffer, accordingly in order to draw or to estimated line two or more pixels are to be done ON. Thus, the result of the line information in the frame buffer is exhibited like a stair; this consequence of having two or more pixels ON to approximating a line among two points say A and B is termed as the Staircase effect. The idea is demonstrated below in following figure.

1666_Line Generation Algorithms - Graphic Primitives 2.png

Figure: Staircase effect

Hence, from the above figure, it is clear that while a line to be drawn is simply illustrated by its end points, after that it can be plotted through making close estimates of the pixels that best suit the line, and this estimation is responsible for the staircase consequence, that miss projects the information of the geometry of line accumulated in the frame buffer like a stair. This defect termed as Staircase consequence is prominent in DDA Line generation algorithms, hence, to remove the defect Bresenham line generation Algorithm was initiated. Now we are going to discuss DDA i.e. Digital Differential Analyzer, Algorithm and Bresenham line generation Algorithm next.

Posted Date: 4/3/2013 1:38:08 AM | Location : United States







Related Discussions:- Line generation algorithms - graphic primitives, Assignment Help, Ask Question on Line generation algorithms - graphic primitives, Get Answer, Expert's Help, Line generation algorithms - graphic primitives Discussions

Write discussion on Line generation algorithms - graphic primitives
Your posts are moderated
Related Questions
Sutherland-Hodgman Algorithm Any polygon of any type of arbitrary shape can be explained with the assist of some set of vertices connected with it. While we try to clip the po


1. What is the purpose behind the Staircase effect? Ans. The approximation concerned in the calculation for finding of pixel position concerned in the display of lines and th

QUESTION (a) Name the spaces and guides in the Figure below                 (b) What is the difference between Pantone and Process colors? Elaborate (c) Explain what i

Reflection about a Line - 2-D and 3-D Transformations Reflection is a transformation that produces the mirror image of an object. Since we discussed that the mirror reflection


Write a program that allows interactive manipulation of the position and orientation of a camera. Draw a teapot at the global origin 0,0,0. You can find a shaded teapot model and

Explain depth buffer method

Important Points for Designing the Animation Sequence There are several applications which do not follow this sequence as, real time computer animations generated by vehicle dr

Magnify a triangle with vertices A = (1,1), B = (3,1) and C = (2,2) to twice its size in such a way that A remains in its original position.  Answer: You need to apply scaling b