Generalized unstructured decimation [computer graphics]
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 16 (6) , 24-32
- https://doi.org/10.1109/38.544069
Abstract
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.Keywords
This publication has 13 references indexed in Scilit:
- Sequencing-by-hybridization revisited: the analog-spectrum proposalIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
- Approximation of Smooth Surfaces and Adaptive Sampling by Piecewise-linear InterpolantsPublished by Elsevier ,1995
- A data reduction scheme for triangulated surfacesComputer Aided Geometric Design, 1994
- Multiresolution modeling and visualization of volume data based on simplicial complexesPublished by Association for Computing Machinery (ACM) ,1994
- Adaptive display algorithm for interactive frame rates during visualization of complex virtual environmentsPublished by Association for Computing Machinery (ACM) ,1993
- Re-tiling polygonal surfacesPublished by Association for Computing Machinery (ACM) ,1992
- Decimation of triangle meshesPublished by Association for Computing Machinery (ACM) ,1992
- Triangulating a non-convex polytypePublished by Association for Computing Machinery (ACM) ,1989
- On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedraPublished by Association for Computing Machinery (ACM) ,1989
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981