Stochastic Depth Buffer Compression using Generalized Plane Encoding

In this paper, we derive compact representations of the depth function for a triangle undergoing motion or defocus blur. Unlike a static primitive, where the depth function is planar, the depth function is a rational function in time and the lens parameters. Furthermore, we show how these compact de...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer graphics forum Jg. 32; H. 2pt1; S. 103 - 112
Hauptverfasser: Andersson, M., Munkberg, J., Akenine-Möller, T.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Oxford, UK Blackwell Publishing Ltd 01.05.2013
Schlagworte:
Algorithms
Analysis
and texture
Buffers
Compressing
Compressors
Computer and Information Sciences
Computer graphics
Computer Sciences
Data- och informationsvetenskap (Datateknik)
Datavetenskap (Datalogi)
E.4 [Coding and Information Theory]: Data compaction and compression
Hardware
I.3.1 [Computer Graphics]: Hardware Architecture-Graphics processors
I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism-Color
I.3.7 [Computer Graphics]: Three‐Dimensional Graphics and Realism—Color, shading, shadowing, and texture
Image processing systems
Mathematical analysis
Mathematical models
Natural Sciences
Naturvetenskap
Representations
shading
shadowing
Studies
Triangles
ISSN:0167-7055, 1467-8659, 1467-8659
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we derive compact representations of the depth function for a triangle undergoing motion or defocus blur. Unlike a static primitive, where the depth function is planar, the depth function is a rational function in time and the lens parameters. Furthermore, we show how these compact depth functions can be used to design an efficient depth buffer compressor/decompressor, which significantly lowers total depth buffer bandwidth usage for a range of test scenes. In addition, our compressor/decompressor is simpler in the number of operations needed to execute, which makes our algorithm more amenable for hardware implementation than previous methods.
Bibliographie:ark:/67375/WNG-6KN163VR-0
istex:BD4B67E3EC6F4DDB27039FD7F817CA85AAB85EFB
ArticleID:CGF12030
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0167-7055
1467-8659
1467-8659
DOI:10.1111/cgf.12030