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

What is monitor, Q. What is Monitor? A Monitor is a television like bo...

Q. What is Monitor? A Monitor is a television like box connected to your computer and providing you a vision into the mind of your PC. It displays what your computer is thinki

Three dimensions, A triangle is having the vertices A(0,0) B(1,2) and C (5,...

A triangle is having the vertices A(0,0) B(1,2) and C (5,2).Magnify the triangle to thrice it''s size while keeping C(5,2) fixed

Tcp connection, what is the opengl code for tcp connection?

what is the opengl code for tcp connection?

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

Animation, Animation, Video and Digital Movies : These are sequences of bi...

Animation, Video and Digital Movies : These are sequences of bitmapped graphic scenes or frames, quickly played back. But animations can also be made inside the authoring system t

Multimedia applications, what are activities to be undertaken or executed a...

what are activities to be undertaken or executed and the expected output of each activity for a plan creation of a movie?

Determine the steps uses in cohen sutherland line clipping, Steps uses in t...

Steps uses in the Cohen Sutherland Line Clipping Algorithm are: Figure: Steps for Cohen Sutherland Line Clipping STEP 1: Input:  x L , x R , y T , y B

Graphics, GRAPHICS: It is one of the core elements of any multimedia ...

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

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