Generalized surface and volume decimation for unstructured tessellated domains
- 1 January 1996
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
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.Keywords
This publication has 15 references indexed in Scilit:
- Agglomeration multigrid for viscous turbulent flowsPublished by American Institute of Aeronautics and Astronautics (AIAA) ,1994
- A data reduction scheme for triangulated surfacesComputer Aided Geometric Design, 1994
- Mesh optimizationPublished by Association for Computing Machinery (ACM) ,1993
- Guaranteed-quality mesh generation for curved surfacesPublished by Association for Computing Machinery (ACM) ,1993
- MESH GENERATION AND OPTIMAL TRIANGULATIONParallel Algorithms, 1992
- Re-tiling polygonal surfacesPublished 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
- Computational GeometryPublished by Springer Nature ,1985
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981