scispace - formally typeset
Book ChapterDOI

Multi-resolution 3D approximations for rendering complex scenes

Jarek Rossignac, +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
BookDOI

CAD Systems Development

Dieter Roller, +1 more
TL;DR: Come with us to read a new book that is coming recently, this is a new coming book that many people really want to read will you be one of them?

Simplification of Arbitrary Polyhedral Meshes

TL;DR: A novel method for simplifying polyhedral meshes while producing multiple levels of detail for progressive transmission and interactive exploration is described and a highly efficient edge-collapsing algorithm is proposed based on a simple edge-selection strategy.
Journal ArticleDOI

Engineered Model Simplification for Simulation Based Structural Design

TL;DR: A fast and robust mesh simplification method is proposed to improve the efficiency of implicit evaluation of large size engineered models and guarantees the practical utility of simplified model in downstream simulation based structural design.
Proceedings ArticleDOI

An efficient local clustering approach for simplification of 3D point-based computer graphics models

TL;DR: An adaptive simplification method (ASM) is introduced which is an efficient technique for simplifying point-based complex 3D model and achieves low running time by clustering the points locally based on the preservation of geometric characteristics.
Journal ArticleDOI

Tightening: morphological simplification

TL;DR: Given a two- or three-dimensional set S of arbitrary topology and a radius r, it is shown how to construct an r-tightening of S, which is a set whose boundary has mean curvature with magnitude less than or equal to 1/r and which only differs from S in a morphologically-defined tolerance zone the authors call the mortar.
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.