Hill, Steve (1994) The Lazy Z-Buffer. Technical report. University of Kent, Computing Laboratory, University of Kent, Canterbury, UK
|
Download (110Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
| Postscript | ||
|
Download (137Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
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 quite different manner to the traditional imperative counterpart. The main result of this paper is to show that the lazy z-buffer is a scan-line method. The effective 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: | Monograph (Technical report) |
|---|---|
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 13 Aug 2009 18:33 |
| Last Modified: | 06 Sep 2011 03:45 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/21182 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
