Book ChapterDOI
Multi-resolution 3D approximations for rendering complex scenes
Jarek Rossignac,Paul Borrel +1 more
- pp 455-465
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.Abstract:
We present a simple, effective, and efficient technique for approximating arbitrary polyhedra. It is based on triangulation and vertex-clustering, and produces a series of 3D approximations (also called “levels of detail”) that resemble the original object from all viewpoints, but contain an increasingly smaller number of faces and vertices. The simplification is more efficient than competing techniques because it does not require building and maintaining a topological adjacency graph. Furthermore, it is better suited for mechanical CAD models which often exhibit patterns of small features, because it automatically groups and simplifies features that are geometrically close, but need not be topologically close or even part of a single connected component Using a lower level of detail when displaying small, distant, or background objects improves graphic performance without a significant loss of perceptual information, and thus enables realtime inspection of complex scenes or a convenient environment for animation or walkthrough preview.read more
Citations
More filters
Journal ArticleDOI
SCROOGE:Perceptually‐Driven Polygon Reduction
TL;DR: This paper presents a methodology for reducing the polygonal complexity of a model, whilst retaining a degree of perceptual predictability, which allows the visual consequences of the degradation to be quantified and accurately modelled.
Proceedings Article
Fast Mesh Decimation by Multiple-Choice Techniques
Jianhua Wu,Leif Kobbelt +1 more
TL;DR: This work presents a new mesh decimation framework which is based on the probabilistic optimization technique of Multiple-Choice algorithms, which leads to a significant speed-up compared to the wellestablished standard framework forMesh decimation as a greedy optimization scheme.
Proceedings ArticleDOI
Discrete differential error metric for surface simplification
TL;DR: A new error metric based on the theory of local differential geometry in such a way that the first and the second order discrete differentials approximated locally on a discrete polygonal surface are integrated into the usual distance error metric.
Proceedings ArticleDOI
Exploiting frame-to-frame coherence in a virtual reality system
TL;DR: 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.
Proceedings ArticleDOI
Geometric Simplification of Foliage
TL;DR: A new automatic simplification algorithm for this part of the tree is presented, the Foliage Simplification Algorithm, which diminishes the number of polygons in the crown, while maintaining the appearance.
References
More filters
Proceedings ArticleDOI
Surface reconstruction from unorganized points
TL;DR: A general method for automatic reconstruction of accurate, concise, piecewise smooth surfaces from unorganized 3D points that is able to automatically infer the topological type of the surface, its geometry, and the presence and location of features such as boundaries, creases, and corners.
Proceedings ArticleDOI
Decimation of triangle meshes
TL;DR: An application independent algorithm that uses local operations on geometry and topology to reduce the number of triangles in a triangle mesh and results from two different geometric modeling applications illustrate the strengths of the algorithm.
Proceedings ArticleDOI
Pyramidal parametrics
TL;DR: This paper advances a “pyramidal parametric” prefiltering and sampling geometry which minimizes aliasing effects and assures continuity within and between target images.
Proceedings ArticleDOI
Re-tiling polygonal surfaces
TL;DR: This paper shows how a new set of vertices can be distributed over the surface of a model and connected to one another to create a re-tiling of a surface that is faithful to both the geometry and the topology of the original surface.
Journal ArticleDOI
Hierarchical geometric models for visible surface algorithms
TL;DR: The geometric structure suggests a recursive descent, visible surface algorithm in which the computation time potentially grows linearly with the visible complexity of the scene, and the range of complexity of an environment is greatly increased.