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
Proceedings ArticleDOI
Two-surface simplification algorithms for polygonal terrain with integrated road features
TL;DR: Two surface simplification algorithms designed for the purpose of constructing a terrain database that is optimized for driving simulation are presented; one using a bottom-up, polygonal refinement approach, the other using a top-down,polygonal removal approach.
Proceedings ArticleDOI
Shape-Sensitive Surface Reconstruction for Low-Resolution Point-Cloud Models
TL;DR: To reconstruct a low-resolution point-cloud model, this study presents a novel shape-sensitive point sampling approach for modifying a sampling region adaptively and adopts the discrete shape operator to quantify model features and determine sampling regions to reconstruct surfaces.
Proceedings Article
Mesh simplification based on Willmore energy weighted quadric error metric
Bogdan Apostol,Vasile Manta +1 more
TL;DR: A new approach to the quadric error metric mesh simplification that uses the local surface features to quantify the cost of an edge collapse and can obtain better geometric results than QSlim simplifications by preserving local features in regions of high importance for the viewer.
Real-time rendering of continuous levels of detail for sparse voxel octrees
Szymon Jabłoński,Tomasz Martyn +1 more
TL;DR: The developed LOD transition algorithm allows to perform a dynamic and continues control of the SVO based objects which have not been available in other works and allows for a LOD change without any graphical artifacts or loss of the virtual scene immersion.
Representation and Fast Display of Complex CSG Models
TL;DR: A system for fast and accurate display of CSG constructive solid geome try models that has been used to convert parts of a submarine storage and handling system model represented as more than CSG trees and consists of more than trimmed spline surfaces.
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.