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
Topological analysis of scalar functions for scientific data visualization
TL;DR: This thesis study and extract the topological features of the data and use them for visualization and develops visualization software that performs local comparison between pairs of functions in datasets containing multiple and sometimes time-varying functions.
Dissertation
Chaine 3D interactive
TL;DR: In this article, the authors present an approach to numeriser les objects de maniere dynamique, adapting the densite de points des l'acquisition en fonction de la complexite de l'objet a numeriser, and ce without a priori sur la forme de l'.
Proceedings ArticleDOI
A new mesh simplification algorithm combining half-edge data structure with modified quadric error metric
TL;DR: A fast mesh simplification algorithm that combines the half-edge data structure with modified quadric error metric (QEM) so that the quality of the simplified meshes for a certain kind of 3D medical models whose normal vectors are computed through voxel gradient during reconstruction can be greatly improved.
View-dependent simplification using parallel half edge collapses
TL;DR: A parallel approach to triangle mesh simplification is presented that is designed to allow fast, view-dependent simplification of manifold triangle meshes and devised a set of boundaries that enable parallel application of half edge collapses even on neighbouring vertices.
Dissertation
Boundary/finite element meshing from volumetric data with applications
TL;DR: In this paper, the authors present a list of figures and their relationships to the authorship of figures in the article.vii List of Figures xiii Chapter xiii and xiii
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.