“Raster-scan hidden surface algorithm techniques” by Hamlin and Gear

Two new techniques are presented for reducing the number of depth calculations in hidden surface elimination. Two new algorithms using the techniques are compared with three existing algorithms and it is shown by examples that the new techniques reduce the number of multiplications involved in the depth calculations. A technique for increasing the parallelism of operations is also presented. This allows the calculation to be done more rapidly in hardware and is particularly useful for generating line drawings rather than the usual TV raster scan images in the common raster-scan hidden surface algorithms.

1. Sutherland, Ivan E., Robert F. Sproull, Robert A. Schumacker, “Sorting and the Hidden-Surface Problem”, Proceedings National Computer Converence 1973, p. 685-693.
2. Bouknight, W. J., “A Procedure for Generation of Three-Dimensional Half-Toned Computer Graphics Presentations”, Communications of the ACM, (13,9), September, 1970, 527-536.
3. Romney, G. W., G. S. Watkins, D. C. Evans, “Real-Time Display of Computer Generated Half-Tone Perspective Pictures”, IFIP, 1968, 973-978.
4. Watkins, G. S., “A Real-Time Visible Surface Algorithm”, Computer Science Department, University of Utah, UTECH-Csc-70-101, June 1970.
5. Erdahl, Alan C., “Displaying Computer Generated Half-Tone Pictures in Real Time”, Computer Science Department, University of Utah, RADC-TR-69-250, 1972.