Premium
Fast Spheres
Author(s) -
Patterson John W.
Publication year - 1993
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/1467-8659.1230061
Subject(s) - floating point , computation , computer science , integer (computer science) , point (geometry) , pixel , spheres , surface (topology) , algorithm , digital geometry , mathematics , computer graphics (images) , digital image , artificial intelligence , image (mathematics) , geometry , image processing , physics , astronomy , programming language
A new method for generating sphere‐like images, using parabolic surfaces delimited by Bresenham's circle‐ generation algorithm, is presented. In many cases the resultant images are indistinguishable from spheres illuminated from a given single direction. The main form of the algorithm uses first and second integer differences to minimise computation and uses typically not more than one floating‐point calculation per sphere. Two variants of the algorithm are given, one optimized for the special case of the light‐source being behind the view‐point, and one in which values are calculated for a z‐buffer hidden‐surface algorithm at the same time as the pixel values. The difference formulae can be exploited by differencing hardware or digital signal processors although very little arithmetic, typically five low‐weight integer operations, including address calculation operations, is required per pixel on a conventional architecture.