Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
