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
Important Notes for Negative Accelerations Note : Having projections of points on curve, above Y axis we will obtain a pattern similar to figure 8 that is needed to produce ne

Define Affine transformation?  A coordinate transformation of the form X= axxx +axyy+bx, y 'ayxx+ayy y+by  is known as a two-dimensional affine transformation. Every of the tra

program for character generation in java?

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

Filled-Area Primitives  Filled-area primitives are one of the most important types of primitives used in Computer Graphics.  Basically filled-area primitives are meant to fill

Example: Exemplify the Bresenham line generation algorithm through digitizing the line along with end points (20, 10) and (30, 18) Solution: m =    (y2 - y1)/( x2 - x1)  =

what is fixed point scaling? how composit transformation techniques works on it

Random Scan Display Device The original cathode ray tube, developed in the late fifties and early sixties, produced charts and pictures, line through line on the tube surface

Advantages and Deficiencies of Gourand Shading Advantages of Gourand Shading: this eliminates the intensity discontinuities related with the constant shading model. Defi

Question: (a) Describe the term ‘Multimedia'. (b) Briefly describe two main reasons to use ‘Compression' in Multimedia. (c) All Multimedia development teams could have