Bresenham's line algorithm - Wikipedia, the free encyclopedia - The Diigo Meta page

• 13 May 14
  

  pubo22

  algorithm software SSR wiki

• 07 Aug 13
  

  aferriss
• 02 Oct 09
  

  jmanning2k

  programming algorithm wikipedia

• 19 Apr 08
  

  York Jong

  The Bresenham line algorithm is an algorithm that determines which points in an n-dimensional raster should be plotted in order to form a close approximation to a straight line between two given points. It is commonly used to draw lines on a computer screen, as it uses only integer addition, subtraction and bit shifting all of which are very cheap operations in standard computer architectures. It is one of the earliest algorithms developed in the field of computer graphics.

  algorithm graphics

• 14 Jan 08
  

  Yeray Darias

  The Bresenham line algorithm is an algorithm that determines which points in an n-dimensional raster should be plotted in order to form a close approximation to a straight line between two given points.

  programming graphics algorithms

• 06 Dec 07
  

  jason m

  dsp image-analysis qrcode math

• 05 Jan 07
  

  oolanoo

  algorithm graphics programming

• 12 Dec 06
  

  Anthony Lieuallen

  programming

• 18 Sep 06
  

  Francisco Glez

Would you like to comment?

Join Diigo for a free account, or sign in if you are already a member.