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

List out the merits and demerits of dvst, List out the merits and demerits ...

List out the merits and demerits of DVST?  The merits and demerits of direct view storage tubes [DVST] are as follows  It has a flat screen Refreshing of screen is

Input and hardcopy devices - 2d shape primitives, Input and Hardcopy Device...

Input and Hardcopy Devices  This section gives a brief introduction to the functioning of some well known input and hardcopy devices. Input devices include keyboard, mouse, sca

Why Video Game Characters Look Better Today, what is the control for Why Vi...

what is the control for Why Video Game Characters Look Better Today

File format-introduction to computer graphics, File format We want an i...

File format We want an image of a Fly. The wings are incompletely transparent and to present that in our presentation what be problematic if suitable file format is not there.

Explain different linear methods for noise cleaning, Question 1 Describe t...

Question 1 Describe the process of formation of image in human eye Structure of the Human Eye Image formation in the Eye Brightness Adaptation and Discrimination

Construction of an isometric projection - transformation, Construction of a...

Construction of an Isometric Projection - Transformation In this projection, the direction of projection i.e. d = (d 1 ,d 2 ,d 3 ) makes an identical angles with all the 3-pr

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,

Find out average unit normal vector at each polygon vertex, To find out ave...

To find out average unit normal vector at each polygon vertex At each polygon vertex as demonstrated by point V in the figure above, the normal vector is acquired by averaging

Carry out a perspective projection, Consider the line segment AB in 3-Dimen...

Consider the line segment AB in 3-Dimentional parallel to the z-axis along with end points A (- 5,4,2) and also B (5,-6,18). Carry out a perspective projection upon the X=0 plane;

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