Mesh Decimation for Displacement Mapping
dc.contributor.author | Collins, Gordon | en_US |
dc.contributor.author | Hilton, Adrian | en_US |
dc.date.accessioned | 2015-11-12T07:16:51Z | |
dc.date.available | 2015-11-12T07:16:51Z | |
dc.date.issued | 2002 | en_US |
dc.identifier.issn | 1017-4656 | en_US |
dc.identifier.uri | http://dx.doi.org/10.2312/egs.20021033 | en_US |
dc.description.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. | en_US |
dc.publisher | Eurographics Association | en_US |
dc.title | Mesh Decimation for Displacement Mapping | en_US |
dc.description.seriesinformation | Eurographics 2002 - Short Presentations | en_US |
Files in this item
This item appears in the following Collection(s)
-
Short Presentations
Eurographics 2002 - Short Presentations