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
Rasterized Planar Face Complex
TL;DR: The rasterized Planar Face Complex (rPFC) proposed here provides a compact representation of an approximation of a PFC, where the precise location of each vertex is quantized to the pixel that contains it and the precise geometry of each curved edge is approximated by the ordered list of pixels traversed by (a chosen polygonal approximation of) the edge.
Journal ArticleDOI
Efficient axial symmetry aware mesh approximation with application to 3D pottery models
TL;DR: A novel and efficient approximation algorithm based on axial symmetry of 3D pottery model that reduces data for mesh representation while preserving the geometric approximation as well as the model quality of the resulting mesh.
Book ChapterDOI
Error metric for perceptual features preservation in polygonal surface simplification
TL;DR: This paper presents a surface simplification algorithm, which can excellently preserve the characteristic features of the original model, even after drastic simplification process, and is efficient in memory usage and useful in real-time rendering applications requiring progressive and incremental rendering of surface data.
Proceedings ArticleDOI
Multi-edge decimation in multi-modal 3D collaborative applications
TL;DR: This paper studies how to improve multi-resolution techniques by performing multi-edge decimation and using annotative commands and investigates how devices with poorer quality 3D object can participate in collaborative actions.
Proceedings ArticleDOI
A Predictive Approach for a Real-Time Remote Visualization of Large Meshes
TL;DR: A visualization approach based on a client-server architecture, in which almost all operations are performed on the server, for remote mesh viewing on triangular meshes.
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.