Bresenham line generation algorithm, Computer Graphics

Assignment Help:

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.


Related Discussions:- Bresenham line generation algorithm

List of 3-d animation software, List of 3-D Animation Software Here is ...

List of 3-D Animation Software Here is a short list of several 3-D animation software are - Softimage ( Microsoft) -  Alias/Wavefront ( SGI) -  3D studia MAX (Autodesk

Jpeg graphics, JPEG Graphics: Another graphic file format usually utilized...

JPEG Graphics: Another graphic file format usually utilized on the Web to minimize graphics file sizes is the Joint Photographic Experts Group that is JPEG compression scheme. Not

Sutherland hodgeman polygon clipping algorithm, What is clipping? Explain S...

What is clipping? Explain Sutherland Hodgeman polygon clipping algorithm with example.  OR Write the algorithm for Sutherland Hodgeman Polygon. Beginning with the initial set of p

Resolution - display devices, Resolution - Display Devices On a display...

Resolution - Display Devices On a display device, the resolution means the maximum number of points that can be displayed simultaneously without an overlap in a row and number

Ray tracing - polygon rendering and ray tracing methods, Ray Tracing - poly...

Ray Tracing - polygon rendering and ray tracing methods "Ray tracing" is a technique of following the light by the eye to the light source. While ray casting only relates its

How many times will vertex appear in the intersection points, 1. For the po...

1. For the polygon shown in Figure on the next page, how many times will the vertex V 1 appear in the set of intersection points for the scan line passing through that point?  How

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.

Which main components are needed for computer graphics, Can you tell which ...

Can you tell which main components (hardware and software) are needed for computer graphics? Besides the computer, some special devices and software may be needed especially fo

BINARY, WHAT THAT S MEANS 0001

WHAT THAT S MEANS 0001

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