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
Optimizing the Accuracy and Compactness of Multi-view Reconstructions
TL;DR: The proposed method is capable of jointly evaluating the accuracy, completeness and compactness of a three-dimensional reconstruction which is represented as a triangle mesh and enables the optimization of both the whole reconstruction pipeline from multi-view stereo data to a compact mesh and the mesh simplification.
3D Surface Simplification Based on Extended Shape Operator
TL;DR: In this article, the Extended Shape Operator (ESO) is proposed to estimate the local surface variation using three-rings shape operator. But the method can only estimate the curvature factors of vertices in manifold surfaces due to Gaussian Curvature.
Dissertation
Modification of semantically enriched FE mesh models
TL;DR: This thesis proposes a new framework for CAD-less product optimisation through FEA, which reduces the mesh preparation and semantics enrichment activities and directly operates the firstly created FE mesh, enriched with semantics, to perform the product modifications required to achieve its optimised version.
Proceedings ArticleDOI
Polyhedral simplification preserving character lines extracted from images
TL;DR: A first attempt to enrich a polyhedral model with semantic information extracted from images is proposed, based on a vertex removal algorithm that uses a heterogeneous map of sizes computed with Information extracted from 2D images of the object.
Proceedings ArticleDOI
A new large-scale terrain real-time simplification algorithm based on Delaunay triangulation
TL;DR: A new bottom-up modeling strategy is put forward, which constructs simplified terrain triangle mesh globally and updates mesh nodes dynamically and has a higher frame rate compared with other algorithms, making it particularly suitable for close-distance flyover simulation of large-scale terrain.
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.