------------------------------------------------------------------------------------------------ Note - this is an implementation of the standard (recursive) Cm-Cl algorithm without further optimizations (except we're using some nice LUTs). A description of the algorithm can be found here: http://en.wikipedia.org/wiki/Catmull-Clark_subdivision_surface The code is mostly O(n), however parts are O(
source not stored for this graph (policy: none)
nothing calls this directly
no test coverage detected