Mobility culling: An efficient rendering algorithm using temporal coherence. (English) Zbl 0984.68746
Summary: Interactive display of complex scenes is a challenging problem in computer graphics. Such current approaches as \(z\)-buffer, level of detail and visibility culling have not fully used the temporal coherence between consecutive frames. When the viewing condition is fixed, the color and depth values of static polygons can be obtained from the result of the previous frame and only the remaining dynamic polygons require rendering. We present a method that enhances the speed of the conventional \(z\)-buffer algorithm by exploiting the above temporal coherence. This algorithm is simple to combine with existing graphics hardware that supports the conventional \(z\)-buffer algorithm. It can manipulate any scene suitable for the \(z\)-buffer algorithm without preprocessing or human intervention. The rendering time is proportional to the number of dynamic polygons in each frame. Experimental results show that our method is faster than the conventional \(z\)-buffer algorithm and the performance enhancement becomes higher as the fraction of static polygons increases.
MSC:
| 68U99 | Computing methodologies and applications |
| 68U10 | Computing methodologies for image processing |
| 68U05 | Computer graphics; computational geometry (digital and algorithmic aspects) |
References:
| [1] | Reality engine graphics. Proceedings of ACM SIGGRAPH ’93 1993; 106-109. |
| [2] | Pineda, Computer Graphics 22 pp 17– (1988) · doi:10.1145/378456.378457 |
| [3] | Visibility computations in densely occluded polyhedral environments. PhD thesis, University of California, Berkeley, 1992. |
| [4] | Hubschman, ACM Transactions on Graphics 1 pp 129– (1982) · doi:10.1145/357299.357302 |
| [5] | Temporally coherent conservative visibility. Proceedings of the 12th ACM Symposium on Computational Geometry 1996; 78-87. |
| [6] | Hierarchical z-buffer visibility. Proceedings of ACM SIGGRAPH ’93 1993; 231-238. |
| [7] | Visibility culling using hierarchical occlusion maps. Proceedings of ACM SIGGRAPH ’97 1997; 77-88. |
| [8] | Hierarchical polygon tiling with coverage masks. Proceedings of ACM SIGGRAPH ’96 1996; 65-74. |
| [9] | Sudarsky, IEEE Transactions on Visualization and Computer Graphics 5 pp 13– (1999) · doi:10.1109/2945.764866 |
| [10] | Fast rendering of complex environments using spatial hierarchy. Proceedings of Graphics Interface ’96 1996; 132-141. |
| [11] | Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments. Computer Graphics Proceedings, Annual Conference Series 1993; 247-254. |
| [12] | Visual navigation of large environments using textured clusters. 1995 Symposium on Interactive 3D Graphics 1995; 95-102. |
| [13] | A subdivision algorithm for computer display of curved surfaces. PhD thesis, Computer Science Department, University of Utah, 1974. |
| [14] | Fixed-View Effects in Real-Time Rendering. A. K. Peters: Natick, MA, 1999; 157-158. |
| [15] | Spatial-temporal coherence in ray tracing. Proceedings of Graphics Interface ’90 1990; 196-204. |
| [16] | Badt, Visual Computer 4 pp 123– (1988) · Zbl 0651.65009 · doi:10.1007/BF01908895 |
| [17] | Object space temporal coherence for ray tracing. Proceedings of Graphics Interface ’92 1992; 176-183. |
| [18] | Priority rendering with virtual reality address recalculation pipeline. Proceedings of ACM SIGGRAPH ’94 1994; 155-162. |
| [19] | Exploiting frame to frame coherence in a virtual reality system. Proceedings of VRAIS ’96 1996; 95-102. |
| [20] | A three dimensional image cache for virtual reality. Proceedings of Eurographics ’96 1996; 227-235. |
| [21] | Hierarchical image caching for accelerated walkthroughs of complex environments. Proceedings of ACM SIGGRAPH ’96 1996; 75-82. |
| [22] | Rendering with coherent layers. Proceedings of ACM SIGGRAPH ’97 1997; 233-242. |
| [23] | The accumulation buffer: hardware support for high-quality rendering. Proceedings of ACM SIGGRAPH ’90 1990; 309-318. |
| [24] | Compositing 3-D rendered images. Proceedings of ACM SIGGRAPH ’85 1985; 41-44. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
