Xiaolin Wu's line algorithm
Xiaolin Wu's line algorithm is an algorithm for line antialiasing.
Antialiasing technique
[edit ]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
[edit ]Like Bresenham’s line algorithm, this method steps along one axis and considers the two nearest pixels to the ideal line. Instead of choosing the nearest, it draws both, with intensities proportional to their vertical distance from the true line. This produces smoother, anti-aliased lines.
The pseudocode below assumes a line where {\displaystyle x_{0}<x_{1}}, {\displaystyle y_{0}<y_{1}}, and the slope {\displaystyle k={\frac {dy}{dx}}} satisfies {\displaystyle 0\leq k\leq 1}. This is a standard simplification — the algorithm can be extended to all directions using symmetry.
The algorithm is well-suited to older CPUs and microcontrollers because:
- It avoids floating point arithmetic in the main loop (only used to initialize d)
- It renders symmetrically from both ends, halving the number of iterations
- The main loop uses only addition and bit shifts — no multiplication or division
function draw_line(x0, y0, x1, y1) N := 8 # brightness resolution (bits) M := 15 # fixed-point fractional bits I := maximum brightness value # Compute gradient and convert to fixed-point step k := float(y1 - y0) / (x1 - x0) d := floor((k << M) + 0.5) # Start with fully covered pixels at each end img[x0, y0] := img[x1, y1] := I D := 0 # Fixed-point accumulator while true: x0 := x0 + 1 x1 := x1 - 1 if x0 > x1: break D := D + d if D overflows: y0 := y0 + 1 y1 := y1 - 1 # Brightness = upper N bits of fractional part of D v := D >> (M - N) img[x0, y0] := img[x1, y1] := I - v img[x0, y0 + 1] := img[x1, y1 -1] := v
Floating Point Implementation
[edit ]functionplot(x,y,c)is plotthepixelat(x,y)withbrightnessc(where0≤c≤1) // fractional part of x functionfpart(x)is returnx-floor(x) functionrfpart(x)is return1-fpart(x) functiondrawLine(x0,y0,x1,y1)is booleansteep:=abs(y1-y0)>abs(x1-x0) ifsteepthen swap(x0,y0) swap(x1,y1) endif ifx0>x1then swap(x0,x1) swap(y0,y1) endif dx:=x1-x0 dy:=y1-y0 ifdx==0.0then gradient:=1.0 else gradient:=dy/dx endif // handle first endpoint xend:=floor(x0) yend:=y0+gradient*(xend-x0) xgap:=1-(x0-xend) xpxl1:=xend// this will be used in the main loop ypxl1:=floor(yend) ifsteepthen plot(ypxl1,xpxl1,rfpart(yend)*xgap) plot(ypxl1+1,xpxl1,fpart(yend)*xgap) else plot(xpxl1,ypxl1,rfpart(yend)*xgap) plot(xpxl1,ypxl1+1,fpart(yend)*xgap) endif intery:=yend+gradient// first y-intersection for the main loop // handle second endpoint xend:=ceil(x1) yend:=y1+gradient*(xend-x1) xgap:=1-(xend-x1) xpxl2:=xend//this will be used in the main loop ypxl2:=floor(yend) ifsteepthen plot(ypxl2,xpxl2,rfpart(yend)*xgap) plot(ypxl2+1,xpxl2,fpart(yend)*xgap) else plot(xpxl2,ypxl2,rfpart(yend)*xgap) plot(xpxl2,ypxl2+1,fpart(yend)*xgap) endif // main loop ifsteepthen forxfromxpxl1+1toxpxl2-1do begin plot(floor(intery),x,rfpart(intery)) plot(floor(intery)+1,x,fpart(intery)) intery:=intery+gradient end else forxfromxpxl1+1toxpxl2-1do begin plot(x,floor(intery),rfpart(intery)) plot(x,floor(intery)+1,fpart(intery)) intery:=intery+gradient end endif endfunction
References
[edit ]- Abrash, Michael (June 1992). "Fast Antialiasing (Column)". Dr. Dobb's Journal . 17 (6): 139(7).
- Wu, Xiaolin (July 1991). "An efficient antialiasing technique" . ACM SIGGRAPH Computer Graphics. 25 (4): 143–152. doi:10.1145/127719.122734. ISBN 0-89791-436-8.
- Wu, Xiaolin (1991). "Fast Anti-Aliased Circle Generation". In James Arvo (ed.). Graphics Gems II. San Francisco: Morgan Kaufmann. pp. 446–450. ISBN 0-12-064480-0.