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

Sprite animation interactive may be non rectangular, Sprite animation inter...

Sprite animation interactive, may be non rectangular (Computer games) In its simplest form it is a 2-D graphic object which moves across the display. Sprites frequently can hav

Write c program which takes points as input from mouse click, Write a C pro...

Write a C program which takes points as input from mouse clicks (left button) and then performs an action.  Apply your program to generate a closed polygon as follows: Every time a

Light wave 3d - softwares for computer animation, Light Wave 3D - Softwares...

Light Wave 3D - Softwares for computer animation It is the other high end PC 3-D computer graphics software package. Originally established for the Amiga platform, it is now a

Persistence of phosphor - display devices, Persistence (of phosphor) - Disp...

Persistence (of phosphor) - Display devices Time it takes the emitted light from screen to decay to one-tenth of its original intensity. The point where an electron gun strikes

Distinguish between uniform scaling and differential scaling, Distinguish b...

Distinguish between uniform scaling and differential scaling?  When the scaling factors sx and sy are assigned to the similar value, a uniform scaling is produced that maintain

Principal vanishing point write respect to z-axis, Principal vanishing poin...

Principal vanishing point write respect to Z-axis Principal vanishing point w.r.t z-axis: By the 3rd row of matrix equation, we declare that the principal vanishing point w

Subdivision algorithm - visible surface detection, Subdivision Algorithm - ...

Subdivision Algorithm - Visible Surface Detection 1) Initialize the area to be the whole screen. 2) Create a PVPL regarding an area, sorted on z min as the smallest z coor

What are the disadvantages of CAD, Disadvantages of CAD - Risk of deski...

Disadvantages of CAD - Risk of deskilling - High training costs to use packages - Can move work overseas     One CAD operator can do work of 5 manual draftsmen

Draw line segment - digital differential analyzer algorithm, Example 1: Dr...

Example 1: Draw line segment from point (2, 4) to (9, 9) by using Digital Differential Analyzer algorithm. Solution: We know usual equation of line is specified via y = mx

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