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

Define b-spline curve, Define B-Spline curve?  A B-Spline curve is a se...

Define B-Spline curve?  A B-Spline curve is a set of piecewise (usually cubic) polynomial segments that pass close to a set of control points. Though the curve does not pass by

What is transformation, What is Transformation?  Transformation is the ...

What is Transformation?  Transformation is the method of introducing changes in the shape size and orientation of the object using scaling rotation reflection shearing & transl

Pixel paint, PIXEL PAINT: The pixel paint file format permits a document t...

PIXEL PAINT: The pixel paint file format permits a document to be opened in the pixel paint and pixel paint professional graphics application. Such format permits you to identify

Non trivial case of cohen sutherland line clippings, Non Trivial Case of co...

Non Trivial Case of cohen sutherland line clippings Case: assume for the line segment PQ, both the trivial rejection and acceptance tests failed (that is, Case 1 and Case 2

2d line segment generation - 2d shape primitives, 2D Line Segment Generatio...

2D Line Segment Generation  A digitally plotted line is basically an approximation of infinite number of points on an abstract line segment by only a finite number of points on

Horizontal retrace - display devices, Horizontal retrace - Display Devices ...

Horizontal retrace - Display Devices In a refresh CRT monitor, the time it takes for an electron beam to return to the left most point on the next horizontal line after refresh

What do you understand by the term branding, Question 1: (a) Explain th...

Question 1: (a) Explain the term ‘Corporate Identity'. (b) Give four examples of what a Corporate Identity comprises of and briefly explain their uses. (c) You are an employe

Sutherland hodgeman polygon clipping algorithm, What is clipping? Explain S...

What is clipping? Explain Sutherland Hodgeman polygon clipping algorithm with example.  OR Write the algorithm for Sutherland Hodgeman Polygon. Beginning with the initial set of p

How we create virtual reality images for use on a computers, How we create ...

How we create virtual reality images for use on a computer system When a virtual tour of, for instance, a house is shown on a website the images need to be first created and th

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