Remark for the bresenham line generation algorithm, Computer Graphics

Remark for the Bresenham Line Generation Algorithm

Remark: The algorithm will be properly the same if we suppose | m | < 1

  • Algorithm | m | < 1:

(a) Input two line ending points and store left end point in (x0, y0) (b) Load (x0, y0) on frame buffer that is, plot the first point.

(c)  Determine Δx, Δy, 2Δy, 2Δy - 2Δx and acquire the beginning value of decision parameter as p0 = 2Δy - Δx

(d) At each xk along the line, beginning at k = 0, perform subsequent test:

If pk < 0, the subsequent plot is (xk + 1, yk) and pk + 1   = pk + 2Δy else subsequent plot is (xk + 1 , yk + 1) and pk + 1 = pk + 2(Δy - Δx)

(e) Repeat step (D) Δx times.

Bresenham Line Generation Algorithm    (| m | < 1)

Δ x ← x1 - x0

Δ y ← y1 - y0

p0 ← 2Δy - Δx

while (x0 < = x1) do

{puton (x0, y0)

if (pi > 0) then

{x0 ← x0 + 1;

y0 ← y0 + 1;

pi + 1 ← pi + 2 (Δy - Δx);

}

if (pi < 0) then

{x0 ← x0 + 1

y0y0

pi + 1 ← pi + 2 Δy

}

}

Posted Date: 3/22/2013 7:28:53 AM | Location : United States







Related Discussions:- Remark for the bresenham line generation algorithm, Assignment Help, Ask Question on Remark for the bresenham line generation algorithm, Get Answer, Expert's Help, Remark for the bresenham line generation algorithm Discussions

Write discussion on Remark for the bresenham line generation algorithm
Your posts are moderated
Related Questions
what is the opengl code for tcp connection?

Methods of Animation - Computer Animation First method: in this, artist makes a succession of cartoon frames that are then combined in a film. Second method: in this,

GRAPHICS: It is one of the core elements of any multimedia application. We all have heard a well-known saying as "one picture conveys a message of 1000 words", hence without

Q.   Describe different types of parallel and perspective projection used in computer graphics.

Taxonomy of Projection - viewing transformation There are different types of projections as per to the view that is essential. The subsequent figure 3 demonstrates taxonomy o

Read the next page and work through the steps: a.  Select a location (anywhere in the world) and research the typical weather (temperature, barometric pressure, and humidity).

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

Sequencing of Animation Design Previously we have discussed many things regarding the traditional and current trends of computer created animation although now it is time to pr

QUESTION a) Differentiate between raster and vector images. b) Explain the concept of bit depth. What is the minimum number if bits required for a one-colour digital image t

Remote Sensing Packages: generally utilized software illustration is-" ERDAS" Characteristics: I.Best suitable for satellite imagery system. II. ERDAS uses geo-spatial in