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

Describe the artwork-advert as accurately as possible, Question: (a) S...

Question: (a) Some adverts are set up only with facts and with no use on concepts/emotions. Name and explain two strengths and two weaknesses of "no use of emotions in

Briefly explain modes and switches, Question 1 Write a note on: Audio Spec...

Question 1 Write a note on: Audio Spectrum & Audio Waveform Question 2 What is high dynamic range color? Explain gradient color Question 3 Describe Time-Remapping

Digital & interactive media has been developed in 20th , Digital & Interact...

Digital & Interactive Media has been developed in 20th century: New media improve visual and verbal content. It doesn¹t replace earlier media. New media lets dynamic alteration of

Define coherence properties, Define coherence properties?  A coherence ...

Define coherence properties?  A coherence property of a scene is a part of a scene by which relate single part of the scene with the other parts of the scene.

What are the features found in CAD, What are the features found in CAD ...

What are the features found in CAD Features generally found in a CAD package involve: - 2D and 3D modelling - Wire frame - Library of parts that can be used in new dra

Zero acceleration (constant speed), Zero Acceleration (Constant Speed ) ...

Zero Acceleration (Constant Speed ) Now, the time spacing for the in-betweens that is: in-between frames is at equal interval; which is if, we want N in-betweens for key frames

Differentiate between lossy and lossless compression, Question: (a) Di...

Question: (a) Differentiate between lossy and lossless compression. (b) State the uses of the two compression standards MPEG-1 and MPEG-2. (c) State three areas where

Normalization transformation, Find the normalization transformation N, whic...

Find the normalization transformation N, which uses the rectangle W(1, 1); X(5, 3); Y(4, 5) and Z(0, 3) as a window and the normalized deice screen as viewpoint.

Phong shading or normal vector interpolation shading, Phong shading OR Norm...

Phong shading OR Normal Vector Interpolation Shading In Gouraud shading we were doing direct interpolation of intensities although a more exact method for rendering a polygon

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