Algorithms for basic line segment plotting, Computer Graphics

Assignment Help:

Algorithms for Basic Line Segment Plotting

There are two important algorithms for basic line segment plotting-DDA algorithm and Bresenham algorithm.  Both the algorithms use the form y = mx + c of the line segment. 

Whereas DDA uses floating point calculations to determine iteratively the pixel positions, Bresenham algorithm is based purely on integer calculation. Therefore, Bresenham algorithm is more efficient and faster.

However, in the literature, you may find modified DDA algorithm that uses integer calculation only.


Related Discussions:- Algorithms for basic line segment plotting

Briefly describe what you understand by smoothing, Question: (a) List a...

Question: (a) List and explain different types of lights that can be used in After Effects. (b) How is the density of dots between the boxes in a motion path related to th

Description and measurement of circadian rhythms, The description and measu...

The description and measurement of circadian rhythms. Describe the standard method used for the recording and graphing of behavioral rhythms in animals, especially the use

Beam penetration method and shadow mask method, Beam Penetration Method and...

Beam Penetration Method and Shadow Mask Method Two methods exist for displaying colors in a CRT monitor - beam penetration method and shadow mask method. Beam penetration metho

Crt - cathode ray tube, CRT - Cathode Ray Tube Electron gun is used...

CRT - Cathode Ray Tube Electron gun is used to send an electron beam aimed at a particular point on the screen. Deflection system is used to make the beam strike the screen

Scan conversion, State the purpose of scan conversion , along with the side...

State the purpose of scan conversion , along with the side effects

Midpoint circle generation algorithm, Midpoint circle generation algorithm ...

Midpoint circle generation algorithm This makes use of a circle function. Based on this circle function, a decision parameter is created which is used to decide successive pixe

Non-zero accelerations - computer animation, Non-Zero Accelerations - Compu...

Non-Zero Accelerations - Computer Animation This method of simulating the motion is fairly helpful introducing the realistic displays of speed changes, particularly at the sta

Modal create, morgen wants to sign up for an account on doggobook, the worl...

morgen wants to sign up for an account on doggobook, the world''s thrid - best social network for dog enthusiasts. she enters her email address and a password into the sign-up form

Trivial rejection case of cohen sutherland line clippings, Trivial Rejectio...

Trivial Rejection Case of cohen sutherland line clippings Case: it  is Trivial Rejection Case; if the logical intersection (AND) of the bit codes of the end points P, Q of

Transformation regarding to the mirror reflection to line, The transformati...

The transformation regarding to the mirror reflection to this line L comprises the subsequent basic transformations: 1) Translate the intersection point A(0,c) to the origin, it

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