1. Explain the Bresenham line generation algorithm via digitizing the line with end  points as (15, 5) and also (25,13).

Ans. Now we are utilizing the Bresenham line generation algorithm via digitising the line with end points (15, 5) and also (25,13).

 m =( y₂ -y₁) /(x₂ - x₁)

= Δy/ Δx

= (13 - 5)/(25 - 15)

= 0.8------------------------(1)

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

So the value of initial decision parameter (p0) = 2Δy - Δ x= 2 * 8 - 10 = 6 ------------(3)

Hence the values of increments for calculating successive decision parameters are:

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

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

Then plot initial point (x₀, y₀) = (15, 5) in the frame buffer now find out successive pixel positions beside line path from decision parameters value of (15, 5).

Posted Date: 4/3/2013 2:21:02 AM | Location : United States

Ask an Expert

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

Write discussion on Explain the bresenham line generation algorithm
Your posts are moderated

Write your message here..

Related Questions

Define coherence properties, Define coherence properties?  A coherence ... Define coherence properties?  A coherence property of a scene is a part of a scene by which relate single part of the scene with the other parts of the scene.

What is bitmap and what is pixmap, What is bitmap and what is pixmap?  ... What is bitmap and what is pixmap?  The frame buffer used in the black and white system is called as bitmap which take one bit per pixel. For systems with many bits per pixel,

Define picture composition, Question 1: (a) The studio provides a perfe... Question 1: (a) The studio provides a perfect environment for various types of video production where precise control is necessary. Discuss. (b) Studio lighting is an import

Lamberts cosine law - diffuse reflection, Lamberts Cosine Law - Diffuse Ref... Lamberts Cosine Law - Diffuse Reflection "LAMBERTS COSINE LAW" specify that the radiant energy from any minute surface area dA in any direction θ relative to the surface usual

Objectives of viewing ttransformation, Objectives of Viewing transformation... Objectives of Viewing transformation After going through this section, you should be capable to: - Explain the projection; - Classify different types of Perspective and

Color Histograms - Scene Categories, How can I perform feature extraction o... How can I perform feature extraction on images of different classes? How to obtain a vector of each class that contains its features?

Draw a long line segment using dda line drawing algorithm, Draw a long line... Draw a long line segment using (i) DDA line drawing algorithm (ii) Bresenham line drawing algorithm (iii) OpenGL function using GL_LINES.  Observe if DDA line segment deflects from

Education, Education, Training, Entertainment and Computer Aided Design ... Education, Training, Entertainment and Computer Aided Design CAD or CADD is an acronym which depending upon who you ask, can stand for: I. Computer Assisted Design. II.

Reflection about a line - 2-d and 3-d transformations, Reflection about a L... Reflection about a Line - 2-D and 3-D Transformations Reflection is a transformation that produces the mirror image of an object. Since we discussed that the mirror reflection

2d clipping algorithms - clipping and 3d primitives, 2D Clipping Algorithms... 2D Clipping Algorithms Clipping is an operation that eliminates invisible objects from the view window.  To understand clipping, recall that when we take a snapshot of a scene,