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
A Resizing Method for 3D Visualization of Digital Elevation Models
TL;DR: A resizing method for 3D visualization of DEMs based on topographic feature that improves seaming carving algorithm to resize DEMs instead of images according to the characterristics ofDEMs is proposed.
Patent
Parallel date processing apparatus
Dave Stuttard,Dave Williams,Eamon O'Dea,Gordon Faulds,John Rhoades,Ken Cameron,Phil Atkin,Paul Winser,Russell David,Ray McConnell,Tim Day,Trey Greer +11 more
TL;DR: A data processing apparatus includes a plurality of processing elements arranged in a single instruction multiple data array for processing data relating to graphical primitives as discussed by the authors, which is used as feedback data for the processing elements for additional processing.
Proceedings ArticleDOI
Low-resolution surface simplification using shape operators with large-scale surface analysis
Juin-Ling Tseng,Yu-Hsuan Lin +1 more
Journal ArticleDOI
Application of discrete curvatures to surface mesh simplification and feature line extraction
TL;DR: Two applications of discrete curvatures for surface mesh processing are presented, one of which deals with simplifying a mesh while preserving its sharp features and the other investigates ways to detect feature lines within a mesh.
Journal Article
Mesh Simplification Algorithm Using Differential Error Metric
TL;DR: This paper proposes a new differential error metric that results in unifying a distance metric and its first and second order differentials, which become tangent vector and curvature metric and shows that its simplified results have better quality and smaller geometry error than others.
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.