The Lazy Z-Buffer

Hill, Steve (1995) The Lazy Z-Buffer. Information Processing Letters, 55 (2). pp. 65-70. ISSN 0020-0190. (doi:10.1016/0020-0190(95)00081-m) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:19597)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
Official URL: https://doi.org/10.1016/0020-0190(95)00081-m

Abstract

This paper describes a new perspective on a fundamental algorithm of three-dimensional computer graphics, namely z-buffering. An implementation of the z-buffer method in a lazy functional language behaves in a manner quite different to its traditional imperative counterpart. The main result of this paper is to demonstrate that the lazy z-buffer is a scan-line method. The essential difference between scan-line methods and z-buffers is one of order of evaluation. A hybrid algorithm with properties common to both z-buffer and scan-line methods is also described.

Item Type:	Article
DOI/Identification number:	10.1016/0020-0190(95)00081-m
Uncontrolled keywords:	FUNCTIONAL PROGRAMMING; COMPUTER GRAPHICS
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science
Institutional Unit:	Schools > School of Computing
Former Institutional Unit:	Theoretical Computing Group Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	P. Ogbuji
Date Deposited:	29 May 2009 14:13 UTC
Last Modified:	20 May 2025 10:06 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/19597 (The current URI for this page, for reference purposes)

University of Kent Author Information

Depositors only (login required):

Altmetric

Total Views

Total unique views of this page since July 2020. For more details click on the image.