Jouppi, Norman P.Chang, Chun-FaA. Kaufmann and W. Strasser and S. Molnar and B.- O. Schneider2014-02-062014-02-0619991-58113-170-41727-3471https://doi.org/10.2312/EGGH/EGGH99/085-094In this paper we present an algorithm for low-cost hardware antialiasing and transparency. This technique keeps a central Z value along with compact floating-point Z gradients in the X and Y dimensions for each fragment within a pixel (hence the name Z3). It uses a small fixed amount of storage per pixel. If the visible complexity of the pixel exceeds the storage space available for the pixel, the minimum number of fragments having the closest Z values are merged. This combines different fragments from the same surface, resulting in both storage and processing efficiency. When operating with opaque surfaces, Z3 can provide superior image quality over sparse supersampling methods that use eight samples per pixel while using storage for only three fragments. Z3 also makes the use of large numbers of samples (e.g., 16) feasible in inexpensive hardware, enabling higher quality images. It is simple to implement because it uses a small fixed number of fragments per pixel. Z3 can also provide order-independent transparency even if many transparent surfaces are present. Moreover, unlike the original A-buffer algorithm it correctly antialiases interpenetrating transparent surfaces because it has three-dimensional Z information within each pixel.1.3.1 [Computer Graphics]Hardware ArchitectureGraphics Processors. 1.3.3 [Computer Graphics]Picture/Image GenerationAntialiasingBitmap and Framebuffer OperationsDisplay Algorithms.