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

Frame animation non- interactive animation rectangular shape, Frame animati...

Frame animation non- interactive animation rectangular shape (Cartoon movies) It is an "internal" animation method, which is, it is animation within a rectangular frame. This i

Object oriented tools, Object Oriented Tools: In such authoring systems, m...

Object Oriented Tools: In such authoring systems, multimedia components and events turn into objects that live in hierarchical order of parent and child relations. Messages are pa

Objectives of 2-d viewing and clipping, Objectives of 2-D Viewing and Clipp...

Objectives of 2-D Viewing and Clipping After going through this section, you should be capable to: 1. Describe the concept of clipping, 2. Observe how line clipping is p

Limitations of cohen sutherland line clipping algorithm, Limitations of Coh...

Limitations of Cohen Sutherland line clipping Algorithm The algorithm is merely applicable to rectangular windows and not to the other convex shaped window. Consequently, a

Computer aided design and drafting, Computer Aided Design and Drafting ...

Computer Aided Design and Drafting CADD or CAD stands for Computer Aided Design and Drafting. This is different from both "draw" and "paint" programs in which measurement is c

Objectives of curves and surfaces - modeling and rendering, Objectives of C...

Objectives of Curves and surfaces - modeling and rendering After going through the section, you should be capable to: Implement the methods utilized to represent a pol

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,

Write a code to continuously rotate square about pivot point, Write a code ...

Write a code to continuously rotate a square about a pivot point.    #include   static GLfloat rotat=0.0;   void init(void); void display(void); void reshape(int w

What is the theory of gestalt, Question: (a) After having worked for s...

Question: (a) After having worked for several years as a graphic designer you decide to start a company of your own; MediaDesign ltd. The most valuable asset of a company is i

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