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

What colour depths are basically used, Q. What Colour depths are basically ...

Q. What Colour depths are basically used? Basically the number of colours are an exponential power of 2 as for Colour Depth n, colours can be showed. The most popular colour mo

Definition of computer animation, Definition of Computer Animation A ti...

Definition of Computer Animation A time dependence phenomenon for imparting visual modifies in any scene as per to any time sequence, the visual modifies could be incorporated

Basic tests - producing polygon surface, Basic Tests - Producing Polygon Su...

Basic Tests - Producing Polygon Surface A few basic tests that must be performed before producing a polygon surface through any graphic package as: 1) All vertexes are list

What is homogeneous coordinate, What is homogeneous coordinate? Discuss the...

What is homogeneous coordinate? Discuss the composite transformation matrix for two successive translations and scaling. In design and picture formation process, many times

Open Gl, Write a program in C/C++ using OpenGL to create (without using bui...

Write a program in C/C++ using OpenGL to create (without using built in function) a square by implementing shear algorithm along 1. X-axis, 2.Y-axis.

Given two triangles p along with vertices as p1(100, Given two triangles P ...

Given two triangles P along with vertices as P1(100,100,50), P2(50,50,50), P3(150,50,50) and q along with vertices as Q1(40,80,60), q2(70,70,50), Q3( 10,75,70), determine that tria

Distinguish between convex and concave polygons, Distinguish between convex...

Distinguish between convex and concave polygons? If the line joining any two points in the polygon lies totally inside the polygon then, they are called as convex polygons. If

Liquid crystal display - graphics hardware, Liquid Crystal Display - Graphi...

Liquid Crystal Display - Graphics Hardware It is a type of display utilized in digital watches and several portable computers. These work along with polarized ambient as outsi

Important points for key frame systems - computer animation, Important poin...

Important points for Key Frame Systems - Computer Animation In key frame systems the "in-between" "tweening" or frames can be created from the specification of two or more key

Proof of subsequent properties of bezier curves, Proof of subsequent proper...

Proof of subsequent properties of Bezier curves Note: Proof of subsequent properties of Bezier curves is left as a work out for the students P' (0) = n (p 1 - p 0 ) P

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