• Corpus ID: 1336986

Fat Borders : Gap Filling For Efficient View-dependent LOD Rendering

@inproceedings{Guthe2003FatB,
  title={Fat Borders : Gap Filling For Efficient View-dependent LOD Rendering},
  author={Michael Guthe and R. Klein},
  year={2003}
}
Real-time high quality rendering of complex models remains a big challenge. Simply splitting the models into several parts which can be simplified and rendered independently introduces disturbing gaps along the common borders. Recent approaches for viewdependent rendering of huge models either neglect the artifacts introduced by the gaps or try to maintain the connectivity of the models. Unfortunately, in the second case the computational complexity and storage requirements of the algorithms… 

Real-Time Out-of-Core Rendering

TLDR
An out-of-core visualization algorithm is presented that overcomes the cracks generated by the simplification algorithm with appropriately shaded Fat Borders and allows for the natural incorporation of state-of theart culling, simplification, compression and prefetching techniques leading to real-time rendering performance of the overall system.

Efficient view-dependent out-of-core visualization

TLDR
This paper presents an out-of-core visualization algorithm that overcomes the cracks generated by the simplification algorithm with appropriately shaded fat borders and comes up with a simple nevertheless efficient view-dependent rendering technique which allows for the natural incorporation of state-of theart culling, simplification, compression and prefetching techniques.

Real-time out-of-core trimmed NURBS rendering and editing

TLDR
A high quality, out-ofcore trimmed NurBS rendering algorithm that supports both an automatic preprocessing of gigabyte sized models and a real-time rendering of the preprocessed models allowing for the seamless integration of interactive editing of the NURBS surfaces is presented.

Interactive high quality trimmed NURBS visualization using appearance preserving tessellation

TLDR
A novel automatic tessellation algorithm that considers the illumination artifacts and is well suited both for the generation of static and dynamic LOD schemes with guaranteed visual fidelity and is capable of high quality visualization of further attributes like curvature, temperature, etc. on surfaces with little or no modification.

GPU-based trimming and tessellation of NURBS and T-Spline surfaces

TLDR
This paper shows how the trimming region can be defined by a trim-texture that is dynamically adapted to the required resolution and allows for an efficient trimming of surfaces on the GPU and combined with GPU-based tessellation of cubic rational surfaces allows a new rendering algorithm for arbitrary trimmed NURBS and T-Spline surfaces with prescribed error in screen space on theGPU.

Tessellation and rendering of trimmed NURBS models in scene graph systems

TLDR
A robust tessellation method for individual trimmed NURBS surfaces is presented which guarantees a geometric error threshold between the polygonal representation and the original analytic surface, and an occlusion culling method is presented, which performs well even in extremely low depth complexity situations and performs at least on par with state of the art occluding methods for high depth complexity scenes.

Efficient Trimmed NURBS Tessellation

TLDR
This paper presents an efficient – with respect to both runtime and to the number of generated triangles – tessellation algorithm for trimmed NURBS surfaces that is capable of guaranteeing a specified geometric approximation error.

Hardware accelerated multi-resolution geometry synthesis

TLDR
This paper proposes a new technique for hardware accelerated multi-resolution geometry synthesis that allows for an almost unlimited model resolution in rendering without excessive memory usage and demonstrates this property by an implementation on programmable graphics hardware.

Streaming HLODs: an out-of-core viewer for network visualization of huge polygon models

A topological hierarchy for functions on triangulated surfaces

TLDR
This work combines topological and geometric methods to construct a multiresolution representation for a function over a two-dimensional domain and uses this data structure to extract topologically valid approximations that satisfy error bounds provided at runtime.

References

SHOWING 1-10 OF 32 REFERENCES

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.

Smooth view-dependent level-of-detail control and its application to terrain rendering

  • Hugues Hoppe
  • Computer Science
    Proceedings Visualization '98 (Cat. No.98CB36276)
  • 1998
TLDR
This paper extends the general VDPM framework to provide temporal coherence through the run-time creation of geomorphs, and introduces a block-based simplification scheme that constructs a progressive mesh as a hierarchy of block refinements to handle huge terrain grids.

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.

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.

FastMesh: efficient view-dependent meshing

  • R. Pajarola
  • Computer Science
    Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001
  • 2001
TLDR
The paper introduces an efficient hierarchical multiresolution triangulation framework based on a half-edge triangle mesh data structure, and presents an optimized computation of several view-dependent error metrics within that framework, providing conservative error bounds.

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.

Generalized View‐Dependent Simplification

TLDR
A cubic‐spline‐based distance metric is proposed that can be used to unify the geometry and topology simplifications by considering the vertex positions and normals in an integrated manner.

Rendering trimmed NURBS with adaptive forward differencing

TLDR
This method extends the AFD technique to higher order, efficiently computes the basis matrix for each span, calculates the shading approximation functions for rational surfaces, and trims and image maps NURB surfaces.

Real-time, continuous level of detail rendering of height fields

TLDR
An algorithm for real-time level of detail reduction and display of high-complexity polygonal surface data that has been implemented for approximating and rendering digital terrain models and other height fields, and consistently performs at interactive frame rates with high image quality.

Dynamic view-dependent simplification for polygonal models

TLDR
An algorithm for performing view-dependent simplifications of a triangulated polygonal model in real-time, which 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.