A compact data structure for implementing loop subdivision.

We present a novel data structure to evaluate and render Loop subdivision surfaces. The algorithm exploits the fact that the Loop subdivision scheme is supported compactly and uses a straightforward technique to evaluate the vertices of new level efficiently. The developed data structure reserves the key topological information for the subdivision connotatively; it requires only a small amount of computer memory and enables local parameterization of the subdivision surface also. [ABSTRACT FROM AUTHOR]