Unstructured surface and volume decimation of tessellated domains

@inproceedings{Renze2015UnstructuredSA,
title={Unstructured surface and volume decimation of tessellated domains},
author={Kevin Joseph Renze},
year={2015}
}

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

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