Steenberg, Eskil2015-11-112015-11-1120011017-4656https://doi.org/10.2312/egs.20011041By 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.Complexity Reduction of Catmull-Clark/Loop Subdivision Surfaces