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

Rapid simplification of multi-attribute meshes

TL;DR: This work presents a rapid simplification algorithm for meshes with multiple vertex attributes, targeted at rendering acceleration for realtime applications, and shows how to handle attribute discontinuities, preserve thin features, and avoid animation-unfriendly contractions.
Proceedings ArticleDOI

Wavelets over curvilinear grids

TL;DR: In this article, the authors develop multiresolution models for analyzing and visualizing two-dimensional flows over curvilinear grids, which are based upon nested spaces of piecewise defined functions defined over nested grid domains.
Journal ArticleDOI

Mesh Simplification Using Vertex Clustering Based on Principal Curvature

TL;DR: This paper improves the defect of error accumulation which consisted in the previous algorithms, not only ensuring the display effect for the model, but also raising the efficiency of algorithm.
Book

Efficient 3D Scene Modeling and Mosaicing

TL;DR: A novel Structure from Motion algorithm is developed that increases mapping accuracy by registering camera views directly with the maps, and an online 3D model simplification algorithm is proposed that presents the advantage of selecting only those vertices that are geometrically representative for the scene.
Proceedings ArticleDOI

Wavelets over curvilinear grids

Nielson, +2 more
TL;DR: This work develops multiresolution models based upon nested spaces of piecewise defined functions defined over nested curvilinear grid domains based on the refinement and decomposition equations for Haar wavelets over these domains.
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.