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

Finding where the ball hits a segment, You will write a two-dimensional pre...

You will write a two-dimensional precursor of the three-dimensional bouncing ball simulation that is one of your choices for a ?nal project. This involves adding functions to your

Important notes for negative accelerations, Important Notes for Negative Ac...

Important Notes for Negative Accelerations Note : Having projections of points on curve, above Y axis we will obtain a pattern similar to figure 8 that is needed to produce ne

Program to implement procedures or functions, The goal of this assignment i...

The goal of this assignment is to implement procedures/functions using x86 assembly. In addition to implementing procedures/functions, this assignment requires to pass arguments us

Explain the advantage and disadvantage of raster crt, Explain the advantage...

Explain the advantage and disadvantage of Raster CRT Advantages Allows solids, not just wireframes Leverages low-cost CRT technology (i.e., TVs) Bright, i.e.

Computer simulation - computer aided design, Computer simulation - Computer...

Computer simulation - Computer Aided Design Computer simulation is the manner of designing a model of a real or theoretical physical system, not including the model on a digit

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

What is scan line algorithm, What is scan line algorithm?  One way to f...

What is scan line algorithm?  One way to fill the polygon is to apply the inside test. I.e. to check whether the pixel is inside the polygon or outside the polygon and then hig

Draw a picture in wpf dotnet programming using visio, is there any plugin a...

is there any plugin available to draw a picture in wpf dotnet programming using microsoft visio?

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