Unstructured surface and volume decimation of tessellated domains

  title={Unstructured surface and volume decimation of tessellated domains},
  author={Kevin Joseph Renze},
  • Kevin Joseph Renze
  • Published 2015
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 tessellation at each step of the… CONTINUE READING


Publications citing this paper.
Showing 1-2 of 2 extracted citations


Publications referenced by this paper.
Showing 1-10 of 11 references

3D unstructured grid refinement and optimization using 'edgeswapping'," NASA Ames Research Center, MofFett

  • A. Gandhi, T. J. Barth
  • 1993
Highly Influential
4 Excerpts

Three-dimensional unstructured grid gen­ eration via incremental insertion and local optimization," NASA Ames Research

  • T. J. Barth, N. L. Wiltberger, A. S. Gandhi
  • 1992
Highly Influential
5 Excerpts

Triangulating a non-convex polytope,

  • B. ChazeUe, L. Palios
  • Proceedings of the 5th Annual ACM Symposium on…
  • 1989
Highly Influential
3 Excerpts

Aspects of unstructured grids and finite-volume solvers for the Euler and Navier-Stokes equations," Lecture Notes for the von Karman Institute for Fluid Dynamics, NASA Ames Research

  • T. J. Barth
  • 1994
2 Excerpts

Three-dimensional mesh generation by triangulation of arbitrary point sets,

  • T. J. Baker
  • AIAA 87-1123-CP,
  • 1987
1 Excerpt

Similar Papers

Loading similar papers…