Towards hardware implementation of loop subdivision

  • Authors:
  • Stephan Bischoff;Leif P. Kobbelt;Hans-Peter Seidel

  • Affiliations:
  • Max-Planck-Institute for Computer Sciences;Max-Planck-Institute for Computer Sciences;Max-Planck-Institute for Computer Sciences

  • Venue:
  • HWWS '00 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 computations costs to a theoretical minimum of about one float [3]-operation per triangle.