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 Article

A Retinex theory based points sampling method for mesh simplification

TL;DR: A Retinex theory based points sampling method for mesh simplification that significantly simplifies the surface without losing local details and global shape.
Dissertation

Wavelet-Based Multiresolution Surface Approximation from Height Fields

Sang-Mook Lee
TL;DR: This dissertation concerns the use of wavelet-based MRA methods to produce a triangular-mesh surface approximation from a single height field dataset, using a small number of approximating elements to satisfy a given error criterion.
Proceedings ArticleDOI

Instant Level-of-Detail

TL;DR: A high-quality parallel mesh simplification algorithm based on the quadric error metric is proposed that can compete with the time required to load additional meshes from a local hard disk.
Proceedings ArticleDOI

A New Adaptive Mesh Simplification Method Using Vertex Clustering with Topology-and-Detail Preserving

TL;DR: A new adaptive mesh simplification method based on vertex clustering is presented in this paper, which can preserve the model topology and subtle geometric features better than traditional vertex-clustering methods.
Journal ArticleDOI

Advances in Collaborative CAD: The-State-of-the-Art

TL;DR: Some important works in Web-based visualization and 3D concise representations, 3D streaming technology and co-design systems and feature-/assembly-based representation are elaborated.
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.