@article{Posch:1989:CBA,
number = 1,
review = {ACM CR 89070500},
month = jan,
optissn = {07300301},
author = {K. C. Posch and W. D. Fellner},
keywords = {algorithms; brushing; design; performance; raster graphics},
localfile = {papers/Posch.1989.CBA.pdf},
journal = jTOG,
doi = {http://doi.acm.org/10.1145/49155.49156},
volume = 8,
subject = {{\bf I.3.3}: Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation, Display algorithms. {\bf I.3.1}:
Computing Methodologies, COMPUTER GRAPHICS, Hardware architecture,
Raster display devices.},
optstatus = {OK},
abstract = {Brushing commonly refers to the drawing of curves with various
line widths in hitmapped graphics systems. It is best done with
circles of suitable diameter so that a constant line width,
independent of the curve's slope, is obtained. Allowing all
possible integer diameters corresponding to all possible integer
line widths results in every second width having an odd value.
Thus, the underlying circle algorithm must be able to handle both
integer and halfinteger radii. Our circlebrush algorithm handles
both situations and produces a "best approximation": All grid
points produced simultaneously minimize (1) the residual, (2) the
Euclidean distance to the circle, and (3) the displacement along
the grid line from the intersection with the circle. Our
circlebrush algorithm was developed in careful consideration of
its implementation in VLSI.},
title = {{T}he {C}ircle{B}rush {A}lgorithm},
pages = {124},
year = 1989,
}
