Mesh Reduction

Mesh reduction refers to a wide variety of algorithms which reduce the size of large datasets. A simple example which applies to structured meshes is subsampling, in which a subset of the vertices in each dimension are retained, resulting in a coarse mesh. More sophisticated techniques apply to both structured and unstructured data, with one or many variables.

Heart DatasetA 256x256 MRI of the chest is reduced by 86% with an error bound of 3%
Pion Collision DatasetA Pion Collision Simulation consisting of 12 variables and 51 timesteps is reduced 60%-85%

Related Papers

Decimation of 2D Scalar Data with Error Control (.psgz) (plates in .psgz format)( pdf) (plates in pdf format)
(Images 1.6Mb),
C. Bajaj and D. Schikore
Purdue University
Computer Science Technical Report CSD-TR-95-005
Feb 1995
 
Error-bounded Reduction of Triangle Meshes With Data(.ps.gz) (.pdf)
C. Bajaj and D. Schikore
Purdue University
SPIE Symposium on Visual Data Exploration and Analysis, San Jose, CA, Jan 1996



Return to Shastra Homepage