Abstract
“Brushing” commonly means the drawing of curves with various linewidths in bit-mapped graphics. For practical reasons it is best done with circles of suitable diameter. In this way we obtain constant linewidth independent of the curve’s slope. Considering all possible integer diameters corresponding to integer linewidths every second width has an odd value. The underlying circle algorithm thus must be able to handle both integer and half-integer radii. The circle-brush algorithm handles both situations and produces “best approximations”: all grid points produced simultaneously minimize (1) the residual, (2) the Buclidean distance to the circle, and (3) the displacement along the grid line from the intersection with the circle. The circle-brush algorithm was developed in close relation to its concrete implementation in a VLSI-structure.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Bressnhara J.E.: Algorithm for Computer Control of a Digital Plotter; IBM Systems Journal 4, No 1 (1965) pp 25–30.
Bresenham J.K.: A Linear Algorithm for Incremental Digital Display of Circular Arcs; Communications of the ACM 20, No 2 (Feb 1977) pp 100–106.
Chaikin G.M.: An Algorithm for High-Speed Curve Generation; Computer Graphics and Image Processing 3 (1979) pp 346–349.
Dunlavey M.R.: Efficient Polygon-Filling Algorithms for Raster Displays; ACM Transactions on Graphics, Vol.2, No.4, (Oct., 1983), 264–273.
Glasser I,. A., Dobberpuhl D.W.: The Design and Analysis of VLSI Circuits; Addison-Wesley, (Reading, Mass., 1985).
International Standardization Organization: Information Processing -Computer Graphics -Graphical Kernel System (GKS) -Functional Description; ISO IS 7942 (Aug. 1985).
ANSI: Graphical Kernel System -GKS; ANSI standard X3.124–1985, (Oct. 1985).
Horn B.K.P.: Circle Generators for Display Devices; Computer Graphics and Image Processing, Vol 5, (1976) pp 280–288.
Maxwell P.C., Baker P.W.: The Generation of Polygons Representing Circles, Ellipses and Hyperbolas; Computer Graphics and Image Processing, 10, (1979), 84–93.
Mcllroy M.D.: Best Approximate Circles on Integer Grids; ACM Transactions on Graphics, Vol.2, No.4, (Oct., 1983), 237–263.
Mead C., Conway L.: Introduction To VLSI Systems; Addison-Wesley, (Reading, Mass., 1980).
Posch K.Ch., Fellner W.D.: The Circle-Brush Algorithm; Technical Report 224, IIG TU Graz (May 1986).
Pitteway M.L.V.: Algorithm for Drawing Ellipses or Hyperbolae with a Digital Plotter; Computer Journal, Vol 10, No 3 (Nov 1967) pp 282–289.
Sueπaga Y., Kamae T., Kobayashi T.: A High-Speed Algorithm for the Generation of Straight Lines and Circular Arcs; IEEE Transactions on Computers, Vol.C-28, (Oct., 1979), 728–736.
van Aken J., Novak M.: Curve-Drawing Algorithms for Raster Displays; ACM Transactions on Graphics, Vol.4, No.2, (April, 1985), 147–169.
Weste N., Eshraghian K.: Principles of CMOS VLSI Design: A Systems Perspective; Addison-Wesley, (Reading, Mass., 1985).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Posch, K.C., Fellner, W.D. (1988). The Circle-Brush Algorithm. In: Earnshaw, R.A. (eds) Theoretical Foundations of Computer Graphics and CAD. NATO ASI Series, vol 40. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83539-1_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-83539-1_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83541-4
Online ISBN: 978-3-642-83539-1
eBook Packages: Springer Book Archive