Line generation algorithms - graphic primitives, Computer Graphics

Assignment Help:

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.


Related Discussions:- Line generation algorithms - graphic primitives

Printing press discovered in 16th century, Printing Press discovered in 16t...

Printing Press discovered in 16th century: Books provided more role models & multiple perspectives. Exposure to books demanded that learners employ critical thinking to r

Voltage or electro-magnetic field tablet and pointer, (a)  Voltage or Elect...

(a)  Voltage or Electro-Magnetic Field Tablet and Pointer: This has a grid of wires, embedded in the tablet surface along with various voltages or magnetic fields consequent to va

Local illumination model - polygon rendering, Local Illumination Model - Po...

Local Illumination Model - Polygon Rendering In this only light that is directly reflected by a light source through a surface to our eyes is observed. No explanation is taken

Normalization transformation, what is normalization transformation?why is i...

what is normalization transformation?why is it needed and important?give simple example also.

Performing rotation about an axis, Performing rotation about an Axis Fo...

Performing rotation about an Axis For performing rotation about an axis parallel to one of the coordinate axes (say z-axis), you first need to translate the axis (and hence the

Explain the merits and demerits of penetration techniques, Explain the meri...

Explain the merits and demerits of Penetration techniques. The merits and demerits of the Penetration techniques are as follows:     It is an inexpensive method.     It h

Depth-buffer (or z-buffer) method , Depth-buffer (or z-buffer) Method ...

Depth-buffer (or z-buffer) Method  Z-buffer method is a fast and easy technique for specifying visible-surfaces. Z-buffer method is also termed to as the z-buffer method, as

Explain the fundamentals of a compression, Question 1 Explain the funda...

Question 1 Explain the fundamental steps in digital image processing 2 Explain the terms reflection, complement and Translation with example diagrams 3 Explain about Imag

Sutherland cohen line clipping algorithm, Describe briefly Sutherland Cohen...

Describe briefly Sutherland Cohen line clipping algorithm.   OR   Describe Cohen Sutherland line clipping algorithm. Cohen Sutherland line clipping algorithm In this algorith

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd