A linear algorithm for incremental digital display of circular arcs
Communications of the ACM
Introduction: Something Old, New, Borrowed, and Blue
IEEE Computer Graphics and Applications
Rendering: Parallelization of Bresenham's Line and Circle Algorithms
IEEE Computer Graphics and Applications
| Hi-index | 0.00 |
In the design of circle drawing, Wright chose to divide a circle into equal subarcs to be rendered by processors. The method is simple, "computationally tractable," and compared with the sequential algorithm, it achieves the speedup of 90%P times (P is number of processors used). In this article, the algorithm is reformulated by using an equal x-step division, which was otherwise regarded "unsatisfactory" and "messy." It is shown that this division method is not only "computationally tractable" but also requires no extra calculations. It achieves a speedup of 100%P.