Xiaolin Wu's line algorithm: Difference between revisions

Revision as of 17:36, 12 April 2021

Revision as of 20:54, 16 May 2021

Line 8:

==Antialiasing technique==

Xiaolin Wu's line algorithm was presented in the article "An Efficient Antialiasing Technique" in the July 1991 issue of ''[[Computer Graphics (publicationnewsletter)|Computer Graphics]]'', as well as in the article "Fast Antialiasing" in the June 1992 issue of ''[[Dr. Dobb's Journal]]''.

[[Bresenham's line algorithm|Bresenham's algorithm]] draws lines extremely quickly, but it does not perform anti-aliasing. In addition, it cannot handle any cases where the line endpoints do not lie exactly on integer points of the pixel grid. A naive approach to anti-aliasing the line would take an extremely long time. Wu's algorithm is comparatively fast, but is still slower than Bresenham's algorithm. The algorithm consists of drawing pairs of pixels straddling the line, each coloured according to its distance from the line. Pixels at the line ends are handled separately. Lines less than one pixel long are handled as a special case.

Line 113:

| url = http://portal.acm.org/citation.cfm?id=122734

| title = An efficient antialiasing technique

| journal=[[Computer Graphics (publicationnewsletter)|Computer Graphics]]

| date=July 1991 | volume=25 | issue=4 | pages=143–152

| doi = 10.1145/127719.122734