scispace - formally typeset
Book ChapterDOI

Multi-resolution 3D approximations for rendering complex scenes

Jarek Rossignac, +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
Proceedings ArticleDOI

Real-time browser for the Digital Museum available with low-cost terminals and low-bandwidth networks

TL;DR: The browser divides the available drawing power and network bandwidth between objects, giving higher priority to those objects that are important for the view, and can provide a proper view to the user in real time, even with low-cost terminals and low-bandwidth networks.
Journal ArticleDOI

Multiresolution Hybrid Mesh for Rapid Prototyping

TL;DR: This paper proposes a hybrid system that takes advantage of structured and unstructured mesh geometry in order to optimise the RP process and make it more robust and accurate.
Dissertation

Efficient models for representing sub-pixel appearances

TL;DR: A new hybrid LOD approach that combines the benefits of meshes and volumetric representations forPrefiltering complex 3D assets, as well as a new approach for prefiltering high-resolution heterogeneous participating media.
Journal ArticleDOI

CAD model simplification using feature simplifications

TL;DR: In previous feature-based simplification methods, a CAD model is progressively simplified by suppressing individual features with low importance one at a time, whereas in the proposed method, each feature itself is gradually simplified based on its feature type.
Journal ArticleDOI

Interactive inspection of complex multi-object industrial assemblies

TL;DR: This paper proposes an algorithm for the interactive inspection of huge models which uses a rendering budget and supports selection of individual objects and sets of objects, displacement of the selected objects and real-time collision detection during these displacements.
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.