Complexity Reduction of Catmull-Clark/Loop Subdivision Surfaces
Loading...
Date
2001
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Eurographics Association
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.
Description
@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},
ISBN = {},
DOI = {/10.2312/egs.20011041}
}