AExE02 · Chapter 2Theory of Computation & Graphics🏛️ Past Licensure QuestionID: e96eb22e
In computer graphics line-drawing rasterization, which algorithm is generally faster because it uses strictly integer addition and subtraction, avoiding floating-point arithmetic?
In computer graphics line-drawing rasterization, which algorithm is generally faster because it uses strictly integer addition and subtraction, avoiding floating-point arithmetic?
Multiple Choice Options
- A✓ Correct Option
Bresenham's line algorithm
- B
Digital Differential Analyzer (DDA) algorithm
- C
Fourier transform line algorithm
- D
CIE color mapping algorithm
Detailed Technical Solution & Explanation
Bresenham's line algorithm uses only fast integer additions, subtractions, and bit shifts, avoiding all floating-point divisions and round-off errors. Therefore, it is faster and more hardware-efficient than the DDA algorithm, which requires floating-point arithmetic.
Option Analysis:
•
Option A (Bresenham's line algorithm): Correct. Pure integer incremental algorithm.
•
Option B (Digital Differential Analyzer (DDA) a...): Requires floating-point addition and rounding at each step.
•
Option C (Fourier transform line algorithm): Signal processing, not raster scan conversion.
•
Option D (CIE color mapping algorithm): Colorimetry model.
Reference: Mock Test 02NEC Licensure Syllabus