Complexity Reduction of Catmull-Clark/Loop Subdivision Surfaces
View/
Date
2001Pay-Per-View via TIB Hannover:
Try if this item/paper is available.
Metadata
Show full item recordAbstract
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.
BibTeX
@inproceedings {10.2312:egs.20011041,
booktitle = {Eurographics 2001 - Short Presentations},
editor = {},
title = {{Complexity Reduction of Catmull-Clark/Loop Subdivision Surfaces}},
author = {Steenberg, Eskil},
year = {2001},
publisher = {Eurographics Association},
ISSN = {1017-4656},
DOI = {10.2312/egs.20011041}
}
booktitle = {Eurographics 2001 - Short Presentations},
editor = {},
title = {{Complexity Reduction of Catmull-Clark/Loop Subdivision Surfaces}},
author = {Steenberg, Eskil},
year = {2001},
publisher = {Eurographics Association},
ISSN = {1017-4656},
DOI = {10.2312/egs.20011041}
}