Skip to main content
Article thumbnail
Location of Repository

Towards hardware implementation of loop subdivision

By Stephan Bischoff, Leif P. Kobbelt and Hans-peter Seidel


We present a novel algorithm to evaluate and render Loop subdivision surfaces. The algorithm exploits the fact that Loop subdivision surfaces are piecewise polynomial and uses the forward difference technique for efficiently computing uniform samples on the limit surface. The main advantage of our algorithm is that it only requires a small and constant amount of memory that does not depend on the subdivision depth. The simple structure of the algorithm enables a scalable degree of hardware implementation. By low-level parallelization of the computations, we can reduce the critical computation costs to a theoretical minimum of about one float[3]operation per triangle

Topics: CR Categories, I.3.1 [Computer Graphics, Hardware Architecture—Graphics processors I.3.3 [Computer Graphics, Picture/Image Generation—Display algorithms Keywords, subdivision surfaces, rendering, forward differences
Publisher: Press
Year: 2010
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.