Hierarchical Z-buffer visibility

An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generated. Ray casting with spatial subdivision does well on criterion (a), but poorly on criterion (b). Traditional Z-buffer scan conversion does well on criterion (b), but poorly on criterion (a). Here we present a hierarchical Z-buffer scan-conversion algorithm that does well on both criteria. The method uses two hierarchical data structures, an object-space octree and an image-space Z pyramid, to accelerate scan conversion. The two hierarchical data structures make it possible to reject hidden geometry very rapidly while rendering visible geometry with the speed of scan conversion. For animation, the algorithm is also able to exploit temporal coherence. The method is well suited to models with high depth complexity, achieving orders of magnitude acceleration in some cases compared to ordinary Z-buffer scan conversion. CR

[1]  Turner Whitted,et al.  A 3-dimensional representation for fast rendering of complex scenes , 1980, SIGGRAPH '80.

[2]  David Jevans.  Object space temporal coherence for ray tracing , 1992 .

[3]  Brian Wyvill,et al.  ADAPTIVE VOXEL SUBDIVISION FOR RAY TRACING , 1988 .

[4]  Carlo H. Séquin,et al.  Visibility Computations in Polyhedral Environments , 1992 .

[5]  Andrew S. Glassner,et al.  Spacetime ray tracing for animation , 1988, IEEE Computer Graphics and Applications.

[6]  John M. Airey,et al.  Increasing update rates in the building walkthrough system with automatic model-space subdivision and potentially visible set calculations , 1990 .

[7]  Andrew S. Glassner,et al.  Space subdivision for fast ray tracing , 1984, IEEE Computer Graphics and Applications.

[8]  Thomas W. Calvert,et al.  Spatio-temporal coherence in ray tracing , 1990 .

[9]  James T. Kajiya,et al.  Ray tracing complex scenes , 1986, SIGGRAPH.

[10]  Steven W. Zucker,et al.  Frame-to-frame coherence and the hidden surface computation: Constraints for a convex world , 1981, SIGGRAPH '81.

[11]  Dieter Baum,et al.  Interactive viewing of large geometric databases using multiprocessor graphics workstations , 1990 .

[12]  Michael R. Kaplan,et al.  The Use of Spatial Coherence in Ray Tracing , 1987 .

[13]  Frederick P. Brooks,et al.  Towards image realism with interactive update rates in complex virtual building environments , 1990, I3D '90.

[14]  Thomas W. Calvert,et al.  Exploiting temporal coherence in ray tracing , 1990 .

[15]  Carlo H. Séquin,et al.  Visibility preprocessing for interactive walkthroughs , 1991, SIGGRAPH.