Important points for bresenham line generation algorithm, Computer Graphics

Important points for Bresenham Line Generation Algorithm


  • Bresenhams algorithm is generalised to lines along with arbitrary slopes with identifying the symmetry among the different octants and quadrants of the coordinate system.
  • For line with positive slope (m) that is, m > 1, so we interchange the roles of x and y direction that is, we step along y directions in unit steps and determine successive x values nearest the line path.
  • For negative slopes the procedures are same except that now, one coordinates reduces as the other raises.
Posted Date: 3/22/2013 7:32:21 AM | Location : United States

Related Discussions:- Important points for bresenham line generation algorithm, Assignment Help, Ask Question on Important points for bresenham line generation algorithm, Get Answer, Expert's Help, Important points for bresenham line generation algorithm Discussions

Write discussion on Important points for bresenham line generation algorithm
Your posts are moderated
Related Questions
OBJECTIVE Since graphics plays a very important role in modern computer application, it is important to know more information about its hardware and software operations. Despite

Digital audio comprises audio signals stored in a digital format. Particularly, the term encompasses the subsequent: 1)   Audio conversion: 1.   Analogue to digital conversi

QUESTION (a) Median filters do not cater for a dynamic range of pixels in a given area, S. Thus to ensure that no loss of image details occur in S, adaptive median filters coul

Plane Equation - Curves and Surfaces Plane is a polygonal surface that bisects its environment in two halves. One is termed to as forward and another as backward half of som

Define Computer graphics.  Computer graphics remains one of the most popular and rapidly growing computer fields. Computer graphics may be explained as a pictorial representati

What is seed fill?  One way to fill a polygon is to begin from a given point (seed) known to be inside  the polygon and highlight outward from this point i.e. neighboring pixel

Area subdivision Method - Visible Surface Detection What are the circumstances to be fulfilled, in Area-subdivision method, thus a surface not to be divided in addition? S

Main objectives: To test to micro-controller I2C protocol bus functionality Setting and displaying accurate time and date on the LCD GENERAL DESCRIPTION The D

Scan line algorithm and seed fill algorithm Two basic approaches are followed in area filling on raster systems.  In the first approach overlap intervals for scan lines that cr