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

Bresenham rasterisation algorithm, 2. Describe how the Bresenham rasterisat...

2. Describe how the Bresenham rasterisation algorithm is advantageous when compared to any other existing method.

Cad-cam systems management, Assignment Task Your task is to review and...

Assignment Task Your task is to review and compare the current cad/cam software systems available with the intention to make a recommendation in the form of a written report f

Different types of simulating motion - computer animation, Different types ...

Different types of Simulating Motion - Computer Animation Here we discuss different ways of simulating motion as: a. Zero Acceleration or Constant Speed b. No

Flat panel, help me discuss about flat panel with respect to emissive and n...

help me discuss about flat panel with respect to emissive and non emissive display

Relationships between scaling and wavelet function spaces, QUESTION (a)...

QUESTION (a) Median filters do not cater for a dynamic range of pixels in a given area, S. Thus to ensure that no loss of image details occur in S, adaptive median filters coul

What do you understand by the term image compositing, Question 1: (a) E...

Question 1: (a) Explain in detail what you understand by the term image compositing and where it is more often used? (b) You are given 3-5 images to make a photo montage/ima

Scan line algorithm - output primitives, Scan Line Algorithm A scan lin...

Scan Line Algorithm A scan line algorithm determines the overlap intervals of the polygon with each scan line to obtain interior points of the polygon for assigning those point

Find out the matrix of projection, Find out the matrix of projection for ca...

Find out the matrix of projection for cavalier projection Answer: Cavalier projection corresponds to tan α = 1, leading to the following matrix.

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