Line segment that joining by using bresenham line algorithm, Computer Graphics

Assignment Help:

Sketch Line Segment That Joining By Using Bresenham Line Algorithm

Example: Sketch line segment that joining (20, 10) and (25, 14) by using Bresenham line generation algorithm.

Solution: (x0, y0) → (20, 10)   ;   (x1, y1) → (25, 14)

m = (y1- y0)/(x1 - x0)

= (14- 10)/(25 - 20)

= 4/5 < 1

Like, m = (Δy)/ (Δx)

= 4/5 =› Δy = 4

→ plot point (20, 10)

pi = 2Δy - Δx

i = 1:                 pi = 2 * 4 - 5 = 3

Here p1 > 0 consequently x0 ← 21; y0 ← 11 now plot (21, 11)

i = 2 as p1 > 0

∴p2 = p1 + 2(Δy - Δx)

= 3 + 2 (4 - 5) = 3 - 2 = 1

p2 > 0; hence x0 ← 22; y0 ← 12 plot (22,12)

i = 3 as p2 > 0

∴p3 = p2 + 2 (Δy - Δx) = 1 + 2 (4 - 5) = - 1

p3 < 0  ∴x0 ← 23

y0 ← 12

plot (23, 12)

i = 4 as p3 < 0

∴p4 = p3 + 2Δy

= -1 + 2 * 4 = 7

∴ x0 ← 24; y0 ← 13

plot (24, 13)

i = 5 as p4 > 0

∴p5 = p4 + 2 (Δy - Δx)

= 7 + 2 (4 - 5) = 5

x0 ← 25; y0 ← 14

Plot (25, 14)

{for i = 6, x0 will be > xi so algorithm terminates


Related Discussions:- Line segment that joining by using bresenham line algorithm

Merits -phong shading or normal vector interpolation shading, Merits -Phong...

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

Scan line polygon fill algorithm - raster graphics, Scan Line Polygon Fill ...

Scan Line Polygon Fill Algorithm - Raster Graphics In such algorithm, the information for a solid body is stored in the frame buffer and utilizing that information each pixel

Achieve a perspective projection on the plane of unit cube, Achieve a persp...

Achieve a perspective projection on the z = 0 plane of the unit cube, demonstrated in Figure (l) from the cop at E (0, 0, 10) upon the z-axis. Figure: I 01:  currently c

Algorithm scan-line, Algorithm (scan-line): For each scan line perform ...

Algorithm (scan-line): For each scan line perform from step (1) to (3). 1) For all pixels on a scan-line, arrange depth [x]=1.0 i.e. max value and Intensity [x] = background

Line clipping algorithm - cohen sutherland algorithm, Line Clipping Algorit...

Line Clipping Algorithm - Cohen Sutherland Algorithm Line is a series of endless number of points; here no two points contain space in among them. Hence, the above said inequa

Image processing, Image Processing New digital technology has made this...

Image Processing New digital technology has made this possible for the manipulation of multi- dimensional signals along with systems which range from easy digital circuits to

Z- buffer algorithm, Q.   Describe the z- Buffer algorithm for hidden surfa...

Q.   Describe the z- Buffer algorithm for hidden surface removal. Ans. Z- buffer method: This method compares surface depths at each pixel position on the projection plane. T

Important point for transformation for isometric projection, Important Poin...

Important Points about the Transformation for isometric projection Note: We can also verify such Isometric transformation matrix through checking all the foreshortening fact

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