Xiaolin Wu's line algorithm


Xiaolin Wu's line algorithm is an algorithm for line antialiasing.

Antialiasing technique

Xiaolin Wu's line algorithm was presented in the article "An Efficient Antialiasing Technique" in the July 1991 issue of Computer Graphics, as well as in the article "Fast Antialiasing" in the June 1992 issue of Dr. Dobb's Journal.
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.
An extension to the algorithm for circle drawing was presented by Xiaolin Wu in the book Graphics Gems II. Just as the line drawing algorithm is a replacement for Bresenham's line drawing algorithm, the circle drawing algorithm is a replacement for Bresenham's circle drawing algorithm.

Algorithm


function plot is
plot the pixel at with brightness c
// integer part of x
function ipart is
return floor
function round is
return ipart
// fractional part of x
function fpart is
return x - floor
function rfpart is
return 1 - fpart
function drawLine is
boolean steep := abs > abs

if steep then
swap
swap
end if
if x0 > x1 then
swap
swap
end if

dx := x1 - x0
dy := y1 - y0
gradient := dy / dx
if dx 0.0 then
gradient := 1.0
end if
// handle first endpoint
xend := round
yend := y0 + gradient *
xgap := rfpart
xpxl1 := xend // this will be used in the main loop
ypxl1 := ipart
if steep then
plot
plot
else
plot
plot
end if
intery := yend + gradient // first y-intersection for the main loop

// handle second endpoint
xend := round
yend := y1 + gradient *
xgap := fpart
xpxl2 := xend //this will be used in the main loop
ypxl2 := ipart
if steep then
plot
plot
else
plot
plot
end if

// main loop
if steep then
for x from xpxl1 + 1 to xpxl2 - 1 do
begin
plot , x, rfpart)
plot+1, x, fpart)
intery := intery + gradient
end
else
for x from xpxl1 + 1 to xpxl2 - 1 do
begin
plot, rfpart)
plot+1, fpart)
intery := intery + gradient
end
end if
end function