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
External memory management and simplification of huge meshes
TL;DR: This paper presents a data structure called Octree-based External Memory Mesh (OEMM), which supports external memory management of complex meshes, loading dynamically in main memory only the selected sections and preserving data consistency during local updates.
Journal ArticleDOI
Efficient Impostor Manipulation for Real-Time Visualization of Urban Scenery
TL;DR: A dynamic segmentation of the dataset is presented into a local three‐dimensional model and a set of impostors used to represent distant scenery, and a new impostor structure is introduced, derived from the level‐of‐detail approach.
Proceedings ArticleDOI
Smooth view-dependent level-of-detail control and its application to terrain rendering
Journal ArticleDOI
Harmonic functions for quadrilateral remeshing of arbitrary manifolds
S. Dong,Scott Kircher,M. Garland +2 more
TL;DR: A new quadrilateral remeshing method for manifolds of arbitrary genus that is at once general, flexible, and efficient is proposed, based on the use of smooth harmonic scalar fields defined over the mesh.
Proceedings ArticleDOI
Interactive visualization of complex plant ecosystems
TL;DR: With this system, the system is able to interactively render very complex landscapes with good visual quality and the data reduction is adapted to the visual importance of geometric objects.
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.