Complexity Reduction of Catmull-Clark/Loop Subdivision Surfaces

dc.contributor.author	Steenberg, Eskil	en_US
dc.date.accessioned	2015-11-11T18:52:52Z
dc.date.available	2015-11-11T18:52:52Z
dc.date.issued	2001	en_US
dc.identifier.issn	1017-4656	en_US
dc.identifier.uri	http://dx.doi.org/10.2312/egs.20011041	en_US
dc.description.abstract	By 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.publisher	Eurographics Association	en_US
dc.title	Complexity Reduction of Catmull-Clark/Loop Subdivision Surfaces	en_US
dc.description.seriesinformation	Eurographics 2001 - Short Presentations	en_US