Show simple item record

dc.contributor.authorSchwartz, Christopheren_US
dc.contributor.authorRuiters, Rolanden_US
dc.contributor.authorKlein, Reinharden_US
dc.contributor.editorB. Levy, X. Tong, and K. Yinen_US
dc.date.accessioned2015-02-28T16:12:57Z
dc.date.available2015-02-28T16:12:57Z
dc.date.issued2013en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/cgf.12242en_US
dc.description.abstractBidirectional Texture Functions (BTFs) are among the highest quality material representations available today and thus well suited whenever an exact reproduction of the appearance of a material or complete object is required. In recent years, BTFs have started to find application in various industrial settings and there is also a growing interest in the cultural heritage domain. BTFs are usually measured from real-world samples and easily consist of tens or hundreds of gigabytes. By using data-driven compression schemes, such as matrix or tensor factorization, a more compact but still faithful representation can be derived. This way, BTFs can be employed for real-time rendering of photo-realistic materials on the GPU. However, scenes containing multiple BTFs or even single objects with high-resolution BTFs easily exceed available GPU memory on today's consumer graphics cards unless quality is drastically reduced by the compression. In this paper, we propose the Bidirectional Sparse Virtual Texture Function, a hierarchical level-of-detail approach for the real-time rendering of large BTFs that requires only a small amount of GPU memory. More importantly, for larger numbers or higher resolutions, the GPU and CPU memory demand grows only marginally and the GPU workload remains constant. For this, we extend the concept of sparse virtual textures by choosing an appropriate prioritization, finding a trade off between factorization components and spatial resolution. Besides GPU memory, the high demand on bandwidth poses a serious limitation for the deployment of conventional BTFs. We show that our proposed representation can be combined with an additional transmission compression and then be employed for streaming the BTF data to the GPU from from local storage media or over the Internet. In combination with the introduced prioritization this allows for the fast visualization of relevant content in the users field of view and a consecutive progressive refinement.en_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.subjectI.3.7 [Computer Graphics]en_US
dc.subjectThree Dimensional Graphics and Realismen_US
dc.subjectColoren_US
dc.subjectshadingen_US
dc.subjectshadowingen_US
dc.subjectand textureen_US
dc.subjectI.3.3 [Computer Graphics]en_US
dc.subjectPicture/Image Generationen_US
dc.subjectDisplay algorithmsen_US
dc.subjectI.3.2 [Computer Graphics]en_US
dc.subjectGraphics Systemsen_US
dc.subjectDistributed/network graphicsen_US
dc.titleLevel-of-Detail Streaming and Rendering using Bidirectional Sparse Virtual Texture Functionsen_US
dc.description.seriesinformationComputer Graphics Forumen_US


Files in this item

Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

  • 32-Issue 7
    Pacific Graphics 2013 - Special Issue

Show simple item record