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
Efficient surface reconstruction method for distributed CAD
Sergei Azernikov,Anath Fischer +1 more
TL;DR: A new fast Reverse Engineering method for creating a 3D computerized model from an unorganized cloud of points derived directly from the problems and difficulties currently associated with remote design over the Internet, thus enabling designers to collaborate at any product development stage.
Proceedings ArticleDOI
The ellipsoidal skeleton in medical applications
TL;DR: A high-level data structure called ellipsoidal skeleton is proposed based on a tree of best partitions of the points set and features data compression, multi-level representation capabilities, surface reconstruction, interactive visualization, relevant parameters extraction, automatic matching and recognition.
DissertationDOI
Image-based modeling for object and human reconstruction
TL;DR: In this paper, the authors propose a solution to solve the problem of disinformation in the context of the RIASSUNTO project. ix RIASSunTO................................................................................................................. ix R.
Journal ArticleDOI
ASM: An adaptive simplification method for 3D point-based models
TL;DR: This paper proposes an Adaptive Simplification Method (ASM) which is an efficient technique for simplifying point-based complex 3D models and achieves a low computation time by clustering the points locally based on the preservation of geometric characteristics.
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.