Generalized View‐Dependent Simplification

@article{ElSana1999GeneralizedVS,
  title={Generalized View‐Dependent Simplification},
  author={Jihad El-Sana and A. Varshney},
  journal={Computer Graphics Forum},
  year={1999},
  volume={18}
}
We propose a technique for performing view‐dependent geometry and topology simplifications for level‐of‐detail‐based renderings of large models. The algorithm proceeds by preprocessing the input dataset into a binary tree, the view‐dependence tree of general vertex‐pair collapses. A subset of the Delaunay edges is used to limit the number of vertex pairs considered for topology simplification. Dependencies to avoid mesh foldovers in manifold regions of the input object are stored in the view… Expand
View-dependent tetrahedral meshing and rendering
TLDR
A meshing framework that builds a compact multi resolution representation for large tetrahedral meshes that integrated this multiresolution representation into a volume rendering environment that supports direct volume rendering as well as a new point based rendering approach. Expand
Techniques for Accelerated View-Dependent Mesh Refinement
TLDR
This work proposes a new method for fast generation of view-dependent level-of-details when the frame-to-frame coherence is low, such as when an object moves or rotates at a rapid rate with respect to the viewpoint. Expand
Efficient implementation of adaptive view-dependent mesh simplification
Multi-resolution representation plays leading roles in virtual geographic environment (VGE), interactive simulation and visualization, fly simulation etc. This paper presents an efficientExpand
Memory Insensitive Simplification for View-Dependent Refinement
TLDR
The focus of this paper is on the out- of-core construction of a level-of-detail hierarchy, and it is shown how the quadric information can be used to concisely represent vertex position, surface normal, error, and curvature information for anisotropic view-dependent coarsening and silhouette preservation. Expand
Dynamic view-dependent visualization of unstructured tetrahedral volumetric meshes
TLDR
A selective refinement scheme that dynamically refines the mesh according to the camera parameters is presented that achieves interactive frame rates for rendering common datasets at decent image resolutions. Expand
Parallel View-Dependent Refinement of Compact Progressive Meshes
TLDR
A compact data structure for progressive meshes optimized for parallel processing and low memory consumption on the GPU is introduced and an efficient LOD adaption algorithm is presented resulting in anAdaption time almost equal to the rendering time of the adapted mesh. Expand
Dynamic view-dependent visualization of unstructured tetrahedral volumetric meshes
TLDR
A selective refinement scheme that dynamically refines the mesh according to the camera parameters that achieves interactive frame rates for rendering common datasets at decent image resolutions. Expand
Efficient NURBS Rendering using View-Dependent LOD and Normal Maps
TLDR
This paper presents a novel approach to apply normal maps to view-depandent NURBS rendering with small memory and computational overhead, and applies this approach to render isophotes and environment maps such as reflection lines on view dependent triangulations with high visual fidelity. Expand
Quick-VDR: interactive view-dependent rendering of massive models
TLDR
This work presents an out-of-core algorithm for computation of a CHPM that includes cluster decomposition, hierarchy generation, and simplification, and makes use of novel cluster dependencies in the preprocess to generate crack-free, drastic simplifications at runtime. Expand
Quick-VDR: out-of-core view-dependent rendering of gigantic models
TLDR
This work presents an out-of-core algorithm for computation of a CHPM that includes cluster decomposition, hierarchy generation, and simplification, and introduces novel cluster dependencies in the preprocess to generate crack-free, drastic simplifications at runtime. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 31 REFERENCES
View-dependent refinement of progressive meshes
TLDR
This paper defines efficient refinement criteria based on the view frustum, surface orientation, and screen-space geometric error, and develops a real-time algorithm for incrementally refining and coarsening the mesh according to these criteria. Expand
Adaptive Real-Time Level-of-Detail-Based Rendering for Polygonal Models
TLDR
The approach is more effective than the current level-of-detail-based rendering approaches for most scientific visualization applications, where there are a limited number of highly complex objects that stay relatively close to the viewer. Expand
Multi-resolution 3D approximations for rendering complex scenes
TLDR
This work presents a simple, effective, and efficient technique for approximating arbitrary polyhedra based on triangulation and vertex-clustering, and produces a series of 3D approximations that resemble the original object from all viewpoints, but contain an increasingly smaller number of faces and vertices. Expand
View-dependent simplification of arbitrary polygonal environments
TLDR
HDS is dynamic, retessellating the scene continually as the user's viewing position shifts, and global, processing the entire database without first decomposing the environment into individual objects. Expand
Illumination dependent refinement of multiresolution meshes
TLDR
The authors describe a new approach for better estimation of normal deviations between different levels of detail that allows for accurate lighting with a minimum number of triangles. Expand
Topology Simplification for Polygonal Virtual Environments
TLDR
It is demonstrated that using topology and geometry simplifications together yields superior multiresolution hierarchies than is possible by using either of them alone. Expand
Progressive meshes
TLDR
The progressive mesh (PM) representation is introduced, a new scheme for storing and transmitting arbitrary triangle meshes that addresses several practical problems in graphics: smooth geomorphing of level-of-detail approximations, progressive transmission, mesh compression, and selective refinement. Expand
A comparison of mesh simplification algorithms
TLDR
A survey and a characterization of the fundamental methods of mesh simplification and the results of an empirical comparison of the simplification codes available in the public domain are discussed. Expand
Progressive simplicial complexes
TLDR
An optimization algorithm for constructing PSC representations for graphics surface models, and the framework on models that are both geometrically and topologically complex is demonstrated. Expand
Fast Multiresolution Surface Meshing
TLDR
A new method for adaptive surface meshing and triangulation which controls the local level-of-detail of the surface approximation by local spectral estimates, and introduces a new class of wavelet space filters acting as "magnifying glasses" on the data. Expand
...
1
2
3
4
...