Complexity Reduction of Catmull-Clark/Loop Subdivision Surfaces

Simple item page
dc.contributor.authorSteenberg, Eskilen_US
dc.date.accessioned2015-11-11T18:52:52Z
dc.date.available2015-11-11T18:52:52Z
dc.date.issued2001en_US
dc.description.abstractBy applying a filter this algorithm can reduce the number of polygons generated by subdividing a mesh dynamically. This algorithm is designed especially for real-time engines where the geometrical complexity is critical. It also avoids edge cracks and is generally more efficient than a general-purpose polygon reduction algorithm.en_US
dc.description.seriesinformationEurographics 2001 - Short Presentationsen_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egs.20011041en_US
dc.publisherEurographics Associationen_US
dc.titleComplexity Reduction of Catmull-Clark/Loop Subdivision Surfacesen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
short88.pdf
Size:
74.21 KB
Format:
Adobe Portable Document Format
Download
Collections
Short Presentations