β Scribed by Marek Doros
No coin nor oath required. For personal study only.
In this paper three algorithms for the generation of discrete circles, rings, and disks are described. They are based on Horn's algorithm , and intended for picture processors (e.g., displays) which can draw individual raster points as graphic primitives. The calculations involve only additions and binary shifts.
π SIMILAR VOLUMES
This paper presents two parallel algorithms for generating graphics primitives on a raster scan display device. The first algorithm is for drawing straight lines and the second is for drawing circles. The line algorithm requires three integer multiplies and one or two integer divides in its setup an
## Abstract We consider the set of slopes of lines formed by joining all pairs of points in some subset __S__ of a Desarguesian affine plane of prime order __p__. If all the slopes are distinct and nonβinfinite, we have a __slope packing__; if every possible nonβinfinite slope occurs, then we have