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
Efficient Point Merging Using Data Parallel Techniques
TL;DR: A fast, efficient approach that uses data parallel techniques for execution in various shared-memory environments is introduced that incorporates a heuristic for efficiently clustering spatially close points together, which is one reason this method performs well against other methods.
Journal ArticleDOI
On-the-fly simplification of large iso-surfaces with per-cube vertex modifiability detection
TL;DR: This work presents an on-the-fly simplification algorithm for out-of-core iso-surfaces generated by Marching Cubes based extraction that is more efficient than cascading out- of-core extraction and simplification, while providing high simplification quality comparable to in-core algorithms.
Proceedings ArticleDOI
Simplification Algorithm for General Meshes
TL;DR: A new mesh simplification framework based on the `simplex collapse', which can produce approximations of simplified complexes of any type of meshes embedded in three dimensional Euclidean spaces, such as triangular meshes, quadrangular meshes, tetrahedral meshes, hexahedral meshes and mixed complexes was presented.
Proceedings ArticleDOI
Lossless compression of topology of 3D triangulated irregular networks
TL;DR: A novel compression technique for high-genus manifolds and non-manifold models is presented, able to produce models compressed by 60% or even more compared to those compressed by GZip.
MonographDOI
Data of scanned points' pre-process and curved surface's reconstruction
TL;DR: The main purpose of this thesis is to establish the color three-dimensional model and implement the data interface with other applications, and the software for processing is designed at the same time, which has the standard interface with the laser scanning system.
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.