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
What is Resolution, how to adjust it.  Resolution: The maximum number of points that can be displayed without overlap on a CRT is referred to as the resolution . A more prec

Q: For the following polygon, prepare an initial sorted edge list and then make the active edge list for scan lines y = 5,20,30,35 Coordinates of the vertices are as shown in Figur

limitationsof dda

Implement displacement mapping and bump mapping on a sphere. The displacement can be whatever your choice. The bump map can be whatever your choice as well.

what is the opengl code for tcp connection?

To transform from the world coordinate system to viewing coordinate system you need to perform the following operations.  a)  Translate the viewing coordinate origin to the worl

Plane Equation - Curves and Surfaces Plane is a polygonal surface that bisects its environment in two halves. One is termed to as forward and another as backward half of som

Assumptions for Polygon or Area Clipping Algorithm Assumption: The viewport and window are rectangular. So only, by identifying the maximum and the minimum coordinates t

Polygon Meshes - Modeling and Rendering A polygonal surface to be sketched may not be easy and may have enormous curls and curves. Illustration: a crushed piece of paper or cr

differentiate between dda and bresenhams line algorithm