
M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, W. Straßer: The Randomized zBuffer Algorithm: Interactive Rendering of Highly Complex Scenes. In: SIGGRAPH 2001 Conference Proceedings, 2001.
Abstract:
We present a new outputsensitive rendering algorithm, the randomized zbuffer algorithm. It renders an image of an arbitrary threedimensional scene consisting of triangular primitives by reconstruction from a dynamically chosen set of random surface sample points. This approach is independent of mesh connectivity and topology. The resulting rendering time grows only logarithmically with the numbers of triangles in the scene. We were able to render walkthroughs of scenes of up to 1E14 triangles at interactive frame rates. Automatic identification of low detail scene components ensures that the rendering speed of the randomized zbuffer cannot drop below that of conventional zbuffer rendering. Experimental and analytical evidence is given that the image quality is comparable to that of common approaches like zbuffer rendering. The precomputed data structures employed by the randomized zbuffer allow for interactive dynamic updates of the scene. Their memory requirements grow only linearly with the number of triangles and allow for a scene graph based instantiation scheme to further reduce memory consumption.
Bibtex:
@INPROCEEDINGS{wfpmsrzb01,
AUTHOR = {Michael Wand and Matthias Fischer and Ingmar Peter and Friedhelm Meyer auf der Heide and Wolfgang Stra{\ss}er},
TITLE = {The Randomized zBuffer Algorithm: Interactive Rendering of Highly Complex Scenes},
BOOKTITLE = {SIGGRAPH 2001},
YEAR = {2001},
ABSTRACT = {We present a new outputsensitive rendering algorithm, the randomized zbuffer algorithm. It renders an image of an arbitrary threedimensional scene consisting of triangular primitives by reconstruction from a dynamically chosen set of random surface sample points. This approach is independent of mesh connectivity and topology. The resulting rendering time grows only logarithmically with the numbers of triangles in the scene. We were able to render walkthroughs of scenes of up to 1E14 triangles at interactive frame rates. Automatic identification of low detail scene components ensures that the rendering speed of the randomized zbuffer cannot drop below that of conventional zbuffer rendering. Experimental and analytical evidence is given that the image quality is comparable to that of common approaches like zbuffer rendering. The precomputed data structures employed by the randomized zbuffer allow for interactive dynamic updates of the scene. Their memory requirements grow only linearly with the number of triangles and allow for a scene graph based instantiation scheme to further reduce memory consumption.}
}

