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

Will the shape of the resulting b-spline curve change, If the spacing betwe...

If the spacing between the knot sequence is uniformly doubled, will the shape of the resulting B-spline curve change?  Justify your answer.

Graphical User interface and interactive input methods, all details of Grap...

all details of Graphical User interface and interactive input methods

Graphic file compression formats, Graphic File Compression Formats Web...

Graphic File Compression Formats Web graphics are by requirement compressed due to the bandwidth issues surrounding networked delivery of information and since image files inc

Ray tracing - polygon rendering & ray tracing methods, Ray Tracing - Polygo...

Ray Tracing - Polygon Rendering & Ray Tracing Methods Ray tracing obeys all rays from the eye of the viewer back to the light sources. The method Ray tracing is very good at

What is rotation, What is rotation?  A 2-D rotation is completed by rep...

What is rotation?  A 2-D rotation is completed by repositioning the coordinates with a circular path, in the x-y plane by making an angle with the axes. The transformation is g

Cases of clip a line segment-pq, Cases of clip a line segment-pq Case...

Cases of clip a line segment-pq Case 1: As we determine a new value of t E that is value of parameter t for any potentially entering (PE) point we select t max as:  t max

Definitions of hypertext, Definitions of Hypertext A manner of pre...

Definitions of Hypertext A manner of presenting information online along with links among one piece of information and the other. These links are termed as hypertext links

What is cubic spline, What is cubic spline?  Cubic splines are a straig...

What is cubic spline?  Cubic splines are a straight forward extension of the methods underlying parabolic spline. The total curve in this case is a sequence of arcs of cubic ra

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