Computer Graphics - Line Drawing Algorithms

A set of vocabulary flashcards covering key terms and concepts from the lecture on line drawing algorithms in computer graphics.

DDA Algorithm

Digital Differential Analyzer; an incremental method for line scan conversion.

Bresenham Algorithm

A line drawing algorithm that uses only integer arithmetic to avoid floating-point operations.

Line Equation

The standard equation for a straight line is y = mx + b, where m is the slope and b is the y-intercept.

Slope (m)

The ratio of vertical change to horizontal change between two points on a line.

y-intercept (b)

The value of y where the line crosses the y-axis (when x=0).

Incremental Method

A technique that calculates values at each step by using the results from previous computations.

Scan Conversion

The process of converting geometric data into pixel or raster format.

Floating Point Operation

Arithmetic operation that uses real numbers, which can lead to rounding errors.

Accumulation Error

The error that arises over multiple computations due to rounding.

Advantages of DDA

Faster than directly using the line equation; simpler calculations using only addition.

Disadvantages of DDA

Less suited for hardware implementation; slower than Bresenham due to floating-point operations.

Advantages of Bresenham

Faster than DDA; uses integer arithmetic; suitable for hardware implementation.

Disadvantages of Bresenham

Limited to basic line drawing; not intended for smooth line rendering.

Pixel Plotting

The action of marking a pixel on the screen at calculated coordinates.

Line Drawing Application

The algorithmic techniques used to accurately draw straight lines on a raster display.