Computational geometry: an introduction
Computational geometry: an introduction
On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Triangulating a non-convex polytype
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
A data reduction scheme for triangulated surfaces
Computer Aided Geometric Design
Multiresolution modeling and visualization of volume data based on simplicial complexes
VVS '94 Proceedings of the 1994 symposium on Volume visualization
Unstructured surface and volume decimation of tessellated domains
Unstructured surface and volume decimation of tessellated domains
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Smooth hierarchical surface triangulations
VIS '97 Proceedings of the 8th conference on Visualization '97
Simplification of tetrahedral meshes
Proceedings of the conference on Visualization '98
Simplification of Tetrahedral meshes with accurate error evaluation
Proceedings of the conference on Visualization '00
TetFusion: an algorithm for rapid tetrahedral mesh simplification
Proceedings of the conference on Visualization '02
Proceedings of the conference on Visualization '02
Multiresolution Representation and Visualization of Volume Data
IEEE Transactions on Visualization and Computer Graphics
Constructing Hierarchies for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Simplification of Tetrahedral Meshes with Error Bounds
IEEE Transactions on Visualization and Computer Graphics
Representing Vertex-Based Simplicial Multi-complexes
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Representing vertex-based simplicial multi-complexes
Digital and image geometry
Mesh Simplification with Hierarchical Shape Analysis and Iterative Edge Contraction
IEEE Transactions on Visualization and Computer Graphics
Compatible Triangulations of Spatial Decompositions
VIS '04 Proceedings of the conference on Visualization '04
Quadric-based simplification in any dimension
ACM Transactions on Graphics (TOG)
View-dependent tetrahedral meshing and rendering
GRAPHITE '05 Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia
Online Remeshing for Soft Tissue Simulation in Surgical Training
IEEE Computer Graphics and Applications
A 3D simplification algorithm for distributed visualization
Computers in Industry
Mesh simplification for QoS control in 3D web environment
HSI'03 Proceedings of the 2nd international conference on Human.society@internet
Local mesh adaptation for soft tissue simulation
ISBMS'06 Proceedings of the Third international conference on Biomedical Simulation
Error metric for perceptual features preservation in polygonal surface simplification
AsiaSim'04 Proceedings of the Third Asian simulation conference on Systems Modeling and Simulation: theory and applications
Interactive particle tracing in time-varying tetrahedral grids
EG PGV'11 Proceedings of the 11th Eurographics conference on Parallel Graphics and Visualization
An integrated pipeline of decompression, simplification and rendering for irregular volume data
VG'05 Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume Graphics
| Hi-index | 0.00 |
This article presents a general algorithm for decimating unstructured discretized data sets. The discretized space may be a planar triangulation, a general 3D surface triangulation, or a 3D tetrahedrization. Local dynamic vertex removal is performed without history information, while preserving the initial topology and boundary geometry. The decimation algorithm generates a candidate tessellation and topologically identifies the set of valid n-simplices that tessellate the convex/nonconvex hole. The algorithm uses only existing vertices and assumes manifold geometry. The research focuses on how to remove a vertex from an existing unstructured n-dimensional tessellation, not on the formulation of application specific decimation criteria.