Issue No. 02 - March/April (2010 vol. 30)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MCG.2009.108
Abhishek Venkatesh , Georgia Institute of Technology
Jarek Rossignac , Georgia Institute of Technology
Split&Tweak subdivisions refine a polygon by inserting a vertex in the middle of each edge (the split) and then moving each vertex to an affine combination of five consecutive vertices (the tweak). Applying d Split&Tweak steps to a control polygon of n vertices requires temporary storage (a footprint) for (n - 5)2d + 5 vertices. Rendering spans independently reduces the footprint to 2d + 5 vertices but increases computation. A proposed ringing approach can reduce the footprint to 4d vertices. The authors describe an efficient implementation, show applications to surfaces and animations, and report CPU and GPU timings for the per-span, global, and ringing approaches.
subdivision, curves, surfaces, B-splines, animation, GPU, geometry shader, computer graphics, graphics and animation, streaming
Abhishek Venkatesh, Jarek Rossignac, "Ringing: Frugal Subdivision of Curves and Surfaces", IEEE Computer Graphics and Applications, vol. 30, no. , pp. 22-33, March/April 2010, doi:10.1109/MCG.2009.108