de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Towards hardware implementation of Loop subdivision

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44138

Bischoff,  Stephan
Computer Graphics, MPI for Informatics, Max Planck Society;

Kobbelt,  Leif
Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45449

Seidel,  Hans-Peter
Computer Graphics, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Bischoff, S., Kobbelt, L., & Seidel, H.-P. (2000). Towards hardware implementation of Loop subdivision. In S. N. Spencer (Ed.), Proceedings of 2000 SIGGRAPH/Eurographics Workshop on Graphics Hardware (pp. 41-50). New York, USA: ACM.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-3500-C
Zusammenfassung
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 {\tt float[3]}-operation per triangle.