The irregular Z-buffer
Gregory Johnson, Juhyun Lee, Christopher A. Burns et al. · ACM Transactions on Graphics · 2005
The classical Z-buffer visibility algorithm samples a scene at regularly spaced points on an image plane. Previously, we introduced an extension of this algorithm called theirregular Z-bufferthat permits sampling of the scene from arbitrary points on the image plane. These sample points are stored in a two-dimensional spatial data structure. Here we present a set of architectural enhancements to the classical Z-buffer acceleration hardware which supports efficient execution of the irregular Z-buffer. These enhancements enable efficient parallel construction and query of certain irregular data structures, including the grid of linked lists used by our algorithm. The enhancements include flexible atomic read-modify-write units located near the memory controller, an internal routing network between these units and the fragment processors, and a MIMD fragment processor design. We simulate the performance of this new architecture and demonstrate that it can be used to render high-quality shadows in geometrically complex scenes at interactive frame rates. We also discuss other uses of the irregular Z-buffer algorithm and the implications of our architectural changes in the design of chip-multiprocessors.
Cited by 69 works. doi:10.1145/1095878.1095889
Authors
References
- A subdivision algorithm for computer display of curved surfaces.
- An improved illumination model for shaded display
- Some techniques for shading machine renderings of solids
- A user-programmable vertex engine
- The Reyes image rendering architecture
- Ray tracing on programmable graphics hardware
- Hierarchical Z-buffer visibility
- Gpu gems 2: programming techniques for high-performance graphics and general-purpose computation
- Glift
- The Reyes image rendering architecture