View-Dependent Refinement of Progressive MeshesHugues HoppeMicrosoft ResearchABSTRACTLevel-of-detail (LOD) representations are an important tool for real-time rendering of complex geometric environments. The previously introduced progressive mesh representation defines for an arbitrary triangle mesh a sequence of approximating meshes optimized for view-independent LOD. In this paper, we introduce a framework for selectively refining an arbitrary progressive mesh according to changing view parameters. We define efficient refinement criteria based on the view frustum, surface orientation, and screen-space geometric error, and develop a real-time algorithmfor incrementally refining and coarsening the mesh according to these criteria. The algorithm exploits view coherence, supports frame rate regulation, and is found to require less than 15% of total frame time on a graphics workstation. moreover, for continuous motions this Workcan Be Amortized over Consecutive Frames. In Addition, Smooth visual transitions (geomorphs) can be constructed between any two selectively refined meshes.A number of previous schemes create view-dependent LOD meshes for height fields (eg terrains) and parametric surfaces (egNURBS). Our framework also performs well for these special cases .. .Notably, the absence of a rigid subdivision structure allows more accurate approximations than with existing schemes We include results for these cases as well as for general meshes CR Categories: I.3.3 [Computer Graphics]: Picture / Image Generation -Displayalgorithms;
I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling - surfaces and object representations Additional Keywords:. Mesh simplification, level-of-detail, multiresolution representations, dynamic tessellation, shape interpolation.1 INTRODUCTIONRendering complex geometric models at interactive rates is a chal-lenging problem in computer graphics. While rendering perfor-mance is continually improving, significant gains are obtained by adapting the complexity of a model to its contribution to the ren-deredimage. The ideal solution would be to efficiently determine the coarsest model that satisfies some perceptual image qualities One common heuristic technique is to author several versions of a model at various levels of detail (LOD);. a detailed triangle mesh is used when the object is close to the viewer, and coarser approx-imations are substituted as the Object Recedes [4, 8]. Such Lod Meshes Can Be Computed Automatically Using Mesh SimplificationEmail: hhoppe@microsoft.com Web: http://research.microsoft.com/ ˘hoppe/techniques (EG [5, 10, 19, 21]). The Recently IntroducesD Progres-Sive Mesh (PM) Reperestation [10] Captures A Continuous Sequence of Meshes Optimized for view-independent LODcontrol, and allows fast traversal of the sequence at runtime.Sets or sequences of view-independent LOD meshes are appro-priate for many applications, but difficulties arise when rendering large-scale models, such as environments, that may surround The viewer:
Many faces of the model may lie outside the view frustum and thus do not contribute to the image (Figure 12a). While these faces are typically culled early in the rendering pipeline, this processing incurs a cost. Similarly, it is often unnecessary to render faces oriented away from the viewer, and such faces are usually culled using a "back-facing" test, but again at a cost. Within the view frustum, some regions of the model may lie much closer to the viewer than others. View- independent LOD meshes fail to provide the appropriate level of detail over the entire model (eg as does the mesh in Figure 12b). Some of these problems can be addressed by representing a graph-icsscene as a hierarchy of meshes. Parts of the scene outside the view frustum can then be removed efficiently using hierarchical culling, and LOD can be adjusted independently for each mesh in the hierarchy [4, 8]. However, establishing such hierarchies on con-tinuous surfaces is a challenging problem. for instance, if a terrain mesh (Figure 11d) is partitioned into blocks, and these blocks arerendered at different levels of detail, one has to address the problem of cracks between the blocks [14]. In addition, the block boundaries are unlikely to correspond to natural features in the surface, result-ing in suboptimal approximations. Similar problems also arise inthe adaptive tessellation of smooth parametric surfaces [1, 13, 18] .Specialized schemes have been presented to adaptively refine meshes for the cases of height fields and parametric surfaces, as Summarized in section 2.1. in this paper
