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
Book ChapterDOI

Simplification of Topologically Complex Assemblies

TL;DR: A new simplification approach intended for scenes containing a huge number of simple objects forming a topologically complex assembly by converting a 3D model to and from an intermediate octree representation.

Progressive Meshes with Controlled Topology Modifications

TL;DR: A combination of two already available techniques allowing for increased control over topology changes induced by the decimation process is presented, allowing for efficient mesh simplification and gradual closing of gaps along the boundaries of the model.
Dissertation

Heterogeneous Computing with Focus on Mechanical Engineering

TL;DR: This dissertation presents four algorithms devoted to take advantage of the computational strengths of heterogeneous architectures, based on state-of-the-art hardware available at the time the research was performed.

Image-Based Pore-Scale Modeling of Inertial Flow in Porous Media and Propped Fractures

Yijie Shen
TL;DR: In this paper, the authors propose a method to solve the problem of "uniformity" in the following manner............................................................................................................................................x x.x.X.x
Proceedings ArticleDOI

Analysis of 3D CAD MESH Simplification Approaches within the Framework of AR Applications for Industrial Assembly Lines

TL;DR: In this paper, the authors analyze different simplification techniques available in the literature and select the most suited technique for CAD models, based on a detailed experimental evaluation, to preserve the quality of the models while ensuring a fluid rendering on the AR devices, at the usual rates of 30-60 frames per second.
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.