Computational geometry: an introduction
Computational geometry: an introduction
Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
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
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
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
Fast and memory efficient polygonal simplification
Proceedings of the conference on Visualization '98
Evaluation of Memoryless Simplification
IEEE Transactions on Visualization and Computer Graphics
Analyzing Engineering Simulations in a Virtual Environment
IEEE Computer Graphics and Applications
Online Multiresolution Volumetric Mass Spring Model for Real Time Soft Tissue Deformation
MICCAI '02 Proceedings of the 5th International Conference on Medical Image Computing and Computer-Assisted Intervention-Part II
| Hi-index | 0.00 |
A general algorithm for decimating unstructured discretized data sets is presented. The discretized space may be a planar triangulation, a general 3D surface triangulation, or a 3D tetrahedrization. The decimation algorithm enforces Dirichlet boundary conditions, uses only existing vertices, and assumes manifold geometry. Local dynamic vertex removal is performed without history information, while preserving the initial topology and boundary geometry. The research focuses on how to remove a vertex from an existing unstructured n-dimensional tessellation, not on the formulation of decimation criteria. Criteria for removing a candidate vertex may be based on geometric properties or any scalar governing function specific to the application.