Raster Algorithms - CAIG Lab - National Chiao Tung caig.cs.nctu.edu.tw/course/CG2007/slides/ Introduction to Computer Graphics 11 Bresenham’s Algorithm •DDA requires one floating point addition per step. •Bresenham’s algorithm eliminates all floating point operations •Consider only 1 ≥m ≥0 –Other cases by ...

  • Published on
    18-Apr-2018

  • View
    218

  • Download
    4

Recommended

View more >