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
Posted Content

On the Correspondence of Open and Closed Strings

TL;DR: In this article, a new approach to bosonic boundary string field theory on curved target spaces is developed, which allows to demonstrate techniques to identify closed string excitations in the open string sector.
Proceedings ArticleDOI

Multilevel deformation model applied to hand simulation for virtual actors

TL;DR: The purpose is to propose a multilevel deformable model that is able to work at various levels of details in a real-time environment and illustrate by its application to human hands simulation.
Journal ArticleDOI

Parallel mesh simplification using embedded tree collapsing

TL;DR: A novel parallel algorithm for mesh simplification that can reduce an input triangle mesh with highly improved performance and consistently outperformed the prior GPU algorithm of Papageorgiou and Platis by a factor of 10 or higher is presented.
Journal ArticleDOI

Developing Efficient Mechanisms for BIM-to-AR/VR Data Transfer

TL;DR: This work presents a meta-modelling architecture suitable for the visualization of building information modeling (BIM) models using augmented reality/virtual reality (AR/VR) technology.
Journal ArticleDOI

An Adaptive Sampling Scheme for Out‐of‐Core Simplification

TL;DR: This paper presents an adaptive sampling scheme, called the balanced retriangulation (BR), for out‐of‐core simplification, that preserves surface details significantly better than uniform sampling algorithms such as uniform clustering.
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.