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
Touch Panels - Input and output devices It allows displayed screen or object positions to be selected along with the touch of the finger and is also termed as Touch Sensitive

Example 1: Draw line segment from point (2, 4) to (9, 9) by using Digital Differential Analyzer algorithm. Solution: We know usual equation of line is specified via y = mx

View Volumes and General Projection Transformations You have to remember that the view volume is the volume which sets up near and far extents, top and bottom extents and left


Example 1 : Determine the number of memory bits essential for three bit plane frame buffer for the 512 x 512 raster Solution: Whole memory bits needed are 3 x 512 x 512 = 786,

What are the advantages of laser printer  High speed, precision and economy. Quality printers. .Cheap to handle Lasts for longer time.

Define clipping and covering (exterior clipping)? Clipping is the process of cutting a graphics display to neatly fit a predefined graphics region or the view port.  This is

A convex polygonal region having n- vertices {P 0 , P 1 , P 2 ..., P n - 1 , P n , P 0 } or lattice points to be identified by the user includes the convex window area. To be exact

Projections - Viewing Transformation Specified 3-D object in a space, Projection can be explained as a mapping of 3-D object into 2-D viewing screen. Now, 2-D screen is termed

De Casteljau Algorithm For computation of Bézier curves an iterative algorithm known as de Casteljau algorithm is used.  The algorithm uses repeated linear interpolation.