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
Book ChapterDOI
Representation and Processing of Surface Data
TL;DR: The shape of a three-dimensional object is sampled for that purpose and turned into a description for computer aided design (CAD), which enables processing of physical design models on a computer (see Section 8.1).
Patent
System and method for the coordinated simplification of surface and wire-frame descriptions of a geometric model
TL;DR: In this article, a system simplifies a geometric model to accelerate the rendering of the geometric model by storing a surface description of the model in one or more of the system memories.
Proceedings ArticleDOI
The DSO Feature Based Point Cloud Simplification
Pai Feng Lee,Chia-Ping Huang +1 more
TL;DR: The proposed method improves the Quadric Error Metric of vertex pair contraction and not only effectively simplifies the point cloud model and keeps the features of object model, but also decreases the preprocessing time cost associated with feature analysis.
Journal ArticleDOI
Efficient measurement of shape dissimilarity between 3D models using Z-buffer and surface roving method
TL;DR: A novel method called surface roving technique to estimate the shape dissimilarity between 3D models by exploiting a virtual camera and Z-buffer, which is commonly used in 3D graphics.
Proceedings Article
Adaptive Polygonal Mesh Simplification With Discrete Centroidal Voronoi Diagrams
TL;DR: An adaptive polygonal mesh coarsening algorithm based on the clustering of the input mesh triangles, driven by a discretized variationnal definition of centroidal tesselations that is able to simplify meshes with high complexity i.e. meshes with a large number of vertices and high genus.
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.