Bresenham line generation algorithm, Computer Graphics

Bresenham Line Generation Algorithm

This algorithm is exact and efficient raster line generation algorithm. Such algorithm scan converts lines utilizing only incremental integer calculations and such calculations can also be adapted to exhibit circles and the other curves.

506_Bresenham Line Generation Algorithm.png

Figure: Bresenham line generation

Sampling at Unit x distance as in above figure of Bresenham line generation, we require to decide that of the two probable pixel position is closer to the line path at all sample steps.

In line1: we require to decide that at subsequent sample position where to plot the pixel at position as (11, 11) or at position (11, 12).

Likewise, In line2: the subsequent pixel has to be (11, 13) or be (11, 12) or what option of pixel is to be done to draw a line is specified by Bresenham, through testing the sign of the integer parameter that value is proportional to the dissimilarity among the separation of the two pixel positions from definite line path. In this part, we will discuss this algorithm for positive slope (0 < m < 1). If the slope is -ive then, utilize reflection transformation to transform the line segment along with negative slope to line segment along with positive slope. So this time, let us discuss the generation of line one more time in two situations as in the case of Digital Differential Analyzer line generation.

Posted Date: 3/22/2013 7:18:48 AM | Location : United States







Related Discussions:- Bresenham line generation algorithm, Assignment Help, Ask Question on Bresenham line generation algorithm, Get Answer, Expert's Help, Bresenham line generation algorithm Discussions

Write discussion on Bresenham line generation algorithm
Your posts are moderated
Related Questions
Engineering: CAD has always been an imperative tool in industry. For illustration in automobile design, CAD could be utilized to model a car. Although with the advent of computer

Disadvantages with the Boundary Representation (i) It requires more storage than the corresponding half-space method. (ii) There is no guarantee that the object created is v

Relation between 2-D Euclidean system and Homogeneous coordinate system Suppose that P(x,y) be any point in 2-D Euclidean system. In HCS, we add a third coordinate to the poin

Depth-buffer (or z-buffer) Method  Z-buffer method is a fast and easy technique for specifying visible-surfaces. Z-buffer method is also termed to as the z-buffer method, as

Painting and Drawing While we talk about graphics, we mean pictures can be either photographs or illustrations. If you want to acquire graphics into a Web page or multimedia r

Question 1 What is Multimedia? Explain sound multimedia element Question 2 Explain any three elements of drawings Question 3 Explain any three types of drawing Quest

Digital audio comprises audio signals stored in a digital format. Particularly, the term encompasses the subsequent: 1)   Audio conversion: 1.   Analogue to digital conversi

Persistence (of phosphor) - Display devices Time it takes the emitted light from screen to decay to one-tenth of its original intensity. The point where an electron gun strikes

Cohen Sutherland Line Clippings Algorithm The clipping problem is identified by dividing the region surrounding the window area into four segments Up as U, Down as D, Left as

Entertainment - Applications For Computer Animation Advertising, Games, Film, Video, Television, Multimedia are various of the entertainment fields wherein computer animation h