Mesh Decimation for Displacement Mapping
Abstract
We present a mesh decimation algorithm for triangular meshes. Unlike other decimation algorithms we are not concerned with geometric error but with the existence of a displacement mapping which can map between the original and decimated meshes. We use the implicit function theorem to derive a condition which ensures the existence of a displacement map. The algorithm is applied to some standard scanned models and reduction rates around 99% are seen.
BibTeX
@inproceedings {10.2312:egs.20021033,
booktitle = {Eurographics 2002 - Short Presentations},
editor = {},
title = {{Mesh Decimation for Displacement Mapping}},
author = {Collins, Gordon and Hilton, Adrian},
year = {2002},
publisher = {Eurographics Association},
ISSN = {1017-4656},
DOI = {10.2312/egs.20021033}
}
booktitle = {Eurographics 2002 - Short Presentations},
editor = {},
title = {{Mesh Decimation for Displacement Mapping}},
author = {Collins, Gordon and Hilton, Adrian},
year = {2002},
publisher = {Eurographics Association},
ISSN = {1017-4656},
DOI = {10.2312/egs.20021033}
}