A realtime GPU subdivision kernel
ACM SIGGRAPH 2005 Papers
| Hi-index | 0.00 |
Recently, [1] showed that, in principle, all major features of subdivision algorithms can be realized in the framework of highly parallel stream processing. The authors tested the approach by implementing Catmull-Clark subdivision, with semi-smooth creases and global boundaries, in programmable graphics hardware, at near-realtime speed. Here, we report on adapting the approach to Loop subdivision, discussing challenges we encountered.