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

Why are all resolutions in ratio of 4:3, Q. Why are all resolutions in rati...

Q. Why are all resolutions in ratio of 4:3? The bad news is that almost every monitor can only display upto a maximum of 262,144 colours (i.e.  18 bits/pixel Colour Depth). The

Disadvantage of the raster scan display device, Disadvantage of the Raster ...

Disadvantage of the Raster Scan Display Device The major disadvantage of the raster scan is the jagged nature of the lines, happening from the information that the pixels are

Put the system of a geometric data table for a 3d rectangle, Put the system...

Put the system of a geometric data table for a 3d rectangle. Solution : Vertex Table Edge Table Polygon Surface Table

Exceptional cases - orthographic projection, Exceptional cases - Orthograph...

Exceptional cases - Orthographic Projection 1)   We have an Orthographic projection, if f=0, then cot (β) =0 that is β=90 0 . 2)   β =cot-1 (1)=450 and this Oblique projec

Translation, Translation, Rotation and Scaling -  output primitives 1. ...

Translation, Rotation and Scaling -  output primitives 1. Two basic approaches used in character generation are - Bitmap method and outline method.  2. All 2D geometric tran

What do you mean by high definition systems -what is dvst, what do you mean...

what do you mean by high definition systems? Define aspect ratio?  What is a refresh buffer? What is the difference between bitmap and pitman frame buffer? Explain the basic oper

Non-zero accelerations - computer animation, Non-Zero Accelerations - Compu...

Non-Zero Accelerations - Computer Animation This method of simulating the motion is fairly helpful introducing the realistic displays of speed changes, particularly at the sta

Rotation about z-axis - transformation for 3-d rotation, Rotation about z-a...

Rotation about z-axis - Transformation for 3-d rotation Rotation about z-axis is explained by the xy-plane. Suppose a 3-D point P(x,y,z) be rotated to P'(x',y',z') along with

Event driven devices - polling, Event Driven Devices - Polling Pollin...

Event Driven Devices - Polling Polling: The status of all devices is periodically checked in a repetitive manner through a polling loop. While an event happens, the loop is

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