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
Journal ArticleDOI
3D mesh simplification with feature preservation based on Whale Optimization Algorithm and Differential Evolution
TL;DR: A feature-preservation edge collapse operation to maintain the feature edges and a novel optimization algorithm, WOA-DE, by replacing the exploration phase of the original Whale Optimization Algorithm with the mutate and crossover operations of Differential Evolution to compute the optimal simplified mesh model more efficiently.
Journal ArticleDOI
Variable resolution triangulations
TL;DR: An efficient algorithm is proposed that can extract a triangulation from the Multi-Triangulation (MT), whose level of detail is variable over the domain according to a given threshold function.
Journal ArticleDOI
Collaborative Computer-Aided Design - Research and Development Status
TL;DR: A 3D streaming technology, which can effectively transmit visualization information across networks for Web applications, is highlighted and the algorithms behind it are disclosed.
Journal ArticleDOI
The uc berkeley system for interactive visualization of large architectural models
TL;DR: An interactive building walkthrough system that uses data structures and algorithms to maintain interactive frame rates during visualization of very large models and supports models whose major occluding surfaces are axis-aligned rectangles.
Journal ArticleDOI
Manifold Dual Contouring
Scott Schaefer,Tao Ju,Joe Warren +2 more
TL;DR: This work presents an extension of DC that further guarantees that the mesh generated is a manifold even under adaptive simplification, and proposes an octree-based topology-preserving vertex-clustering algorithm for adaptive contouring.
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.