Exploiting frame-to-frame coherence in a virtual reality system
- 1 January 1996
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A uniform frame rate can be achieved by selecting a level of detail for each visible object such that all the objects can be rendered within the given frame time. With many visible objects a low rendering quality must be chosen if every frame is rendered from scratch. This paper presents a load-adaptive rendering algorithm which exploits frame to frame coherence and re-uses most of the image data generated during previous frames thus decreasing the number of polygons actually rendered by an order of magnitude. Complex distant objects are replaced by polygons with an image of the respective object mapped onto them. Dynamic updates of the images before frame rendering lets these "impostors" closely resemble the original objects. The approach makes efficient use of texture memory and can advantageously be incorporated into the uniform frame rate algorithm.Keywords
This publication has 9 references indexed in Scilit:
- Visual navigation of large environments using textured clustersPublished by Association for Computing Machinery (ACM) ,1995
- Priority rendering with a virtual reality address recalculation pipelinePublished by Association for Computing Machinery (ACM) ,1994
- Mesh optimizationPublished by Association for Computing Machinery (ACM) ,1993
- Adaptive display algorithm for interactive frame rates during visualization of complex virtual environmentsPublished by Association for Computing Machinery (ACM) ,1993
- Re-tiling polygonal surfacesACM SIGGRAPH Computer Graphics, 1992
- Management of large amounts of data in interactive building walkthroughsPublished by Association for Computing Machinery (ACM) ,1992
- Visibility preprocessing for interactive walkthroughsACM SIGGRAPH Computer Graphics, 1991
- Simplification of objects rendered by polygonal approximationsComputers & Graphics, 1991
- Hierarchical geometric models for visible surface algorithmsCommunications of the ACM, 1976