Hill, S. (1995) The Lazy Z-Buffer. Information Processing Letters, 55 (2). pp. 65-70. ISSN 0020-0190.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
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.
|Uncontrolled keywords:||FUNCTIONAL PROGRAMMING; COMPUTER GRAPHICS|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||P. Ogbuji|
|Date Deposited:||29 May 2009 14:13|
|Last Modified:||21 May 2011 23:52|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/19597 (The current URI for this page, for reference purposes)|
- Depositors only (login required):