Mesh Decimation for Displacement Mapping

Simple item page
dc.contributor.authorCollins, Gordonen_US
dc.contributor.authorHilton, Adrianen_US
dc.date.accessioned2015-11-12T07:16:51Z
dc.date.available2015-11-12T07:16:51Z
dc.date.issued2002en_US
dc.description.abstractWe 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.description.seriesinformationEurographics 2002 - Short Presentationsen_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egs.20021033en_US
dc.publisherEurographics Associationen_US
dc.titleMesh Decimation for Displacement Mappingen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
short66.pdf
Size:
263.61 KB
Format:
Adobe Portable Document Format
Download
Collections
Short Presentations