Apparatus and method for Z-buffer compression
US6411295B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Nov 29, 1999 |
| Grant date | Jun 25, 2002 |
| Priority date | — |
| Expiry date | Nov 29, 2019 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06T15/405
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
An apparatus and method are provided for Z-buffer compression and decompression. The memory requirements for Z-buffer are reduced with a slight loss of image quality. When coupled with over-sampling, the Z-buffer compression algorithm of the present invention decreases the memory requirements for over-sampled images with negligible loss of image quality. In one embodiment, once a block of h Z-values has been accumulated in the memory, it is compressed by an encoder. Next, the minimum (MIN) and maximum (MAX) values are recorded. Thereafter, the range between MIN and MAX is divided into a number of intervals (L). Instead of storing each of the 32-bit samples, an index ki is used to represent each sample. The index ki is calculated for i equals 1 to h, using the following equation:ki=(Zi−MIN)*L/(MAX−MIN).This formula will yield a number between 0 and the number of intervals. Next the compressed Z-values are transferred to a Z-buffer. This saves memory space because only 2 full values (MAX and MIN) have to be stored, and the remaining h indices can be stored using smaller numbers of bits because there are only a finite, small number of intervals. To decompress a value, the …
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.