Exemplify bresenham line generation algorithm by digitizing, Computer Graphics

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)

 =   (Δy) /(Δx)

=   (18 -10)/( 30 - 20)  = 0.8-------------------(1)

=> Δy = 8 and Δx = 10-------------------(2)

value of initial decision parameter (p0) = 2Δy - Δx= 2 * 8 - 10 = 6 -----------------(3) value of increments for calculating successive decision parameters are:

2Δy = 2 * 8 = 16;                                                  -------------------(4)

2Δy - 2Δx = 2 * 8 - 2 * 10 = - 4                          -------------------(5)

So plot first point (x0, y0) = (20, 10) in frame buffer at this time determine successive pixel positions beside line path from decision parameters value (20, 10).

k

0

pk

6

 

(xk + 1, yk + 1) (21, 11)

1

2

(22, 12)

2

- 2

(23, 12)

3

14

(24, 13)

4

10

(25, 14)

5

6

(26, 15)

6

2

(27, 16)

7

- 2

(28, 16)

8

14

(29, 17)

9

10

(30, 18)

 

 

← [use step (d) of algorithm Δ x times]

If pk > 0 then increase both X and Y

and pk  +1= pk + 2Δy - 2Δx

If pk < 0 then increase X and not Y

and pk + 1 = pk + 2Δy

 

Posted Date: 3/22/2013 7:39:52 AM | Location : United States







Related Discussions:- Exemplify bresenham line generation algorithm by digitizing, Assignment Help, Ask Question on Exemplify bresenham line generation algorithm by digitizing, Get Answer, Expert's Help, Exemplify bresenham line generation algorithm by digitizing Discussions

Write discussion on Exemplify bresenham line generation algorithm by digitizing
Your posts are moderated
Related Questions
3Dstudio - Softwares for computer animation 3DStudio is a 3-D computer graphics programmed. 3DStudio runs on personal computers. This is relatively simple to use. Several schoo

Test For checking Disjoint Polygons by using of Min-max Test Test 1: For checking disjoint polygons by using of Min-max test. Assume that you have two polygons as P1 and

Hypermedia: it is a superset of hypertext. Hypermedia documents comprise links not only to the other pieces of text, although also to other forms of media: sounds and images and m

Shading - Polygon Rendering and Ray Tracing Methods When one thing is under the exposure of light, so the rays of light are distributed over the surface and there the distribu


The image you have been given for contour extraction is shown in Figure 1. The method for constructing the search space is shown in Figure 2. It is generated from two initial discr

B-spline curves are piecewise smooth polynomial curves.  B-spline curves are defined over an interval which has been partitioned into sub-intervals. On each subinterval B-sp

B-spline curves - clipping and 3d primitives B-spline curves are piecewise polynomial cubes with one or more polynomial pieces with a minimum smoothness requirement.  For examp

Merits -Phong shading or Normal Vector Interpolation Shading Hence by finding intensities at various points across the edge we determine the intensity that is varying across t