Schinko, Christoph ; Ullrich, Torsten ; Fellner, Dieter W. (2011)
Simple and Efficient Normal Encoding with Error Bounds.
Theory and Practice of Computer Graphics 2011.
doi: 10.2312/LocalChapterEvents/TPCG/TPCG11/063-065
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
Normal maps and bump maps are commonly used techniques to make 3D scenes more realistic. Consequently, the efficient storage of normal vectors is an important task in computer graphics. This work presents a fast, lossy compression/decompression algorithm for arbitrary resolutions. The complete source code is listed in the appendix and is ready to use.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2011 |
| Autor(en): | Schinko, Christoph ; Ullrich, Torsten ; Fellner, Dieter W. |
| Art des Eintrags: | Bibliographie |
| Titel: | Simple and Efficient Normal Encoding with Error Bounds |
| Sprache: | Englisch |
| Publikationsjahr: | 2011 |
| Verlag: | Eurographics Association, Goslar |
| Veranstaltungstitel: | Theory and Practice of Computer Graphics 2011 |
| DOI: | 10.2312/LocalChapterEvents/TPCG/TPCG11/063-065 |
| Kurzbeschreibung (Abstract): | Normal maps and bump maps are commonly used techniques to make 3D scenes more realistic. Consequently, the efficient storage of normal vectors is an important task in computer graphics. This work presents a fast, lossy compression/decompression algorithm for arbitrary resolutions. The complete source code is listed in the appendix and is ready to use. |
| Freie Schlagworte: | Forschungsgruppe Semantic Models, Immersive Systems (SMIS), Business Field: Virtual engineering, Research Area: Confluence of graphics and vision, Compression, Encoding, Optimization |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Graphisch-Interaktive Systeme |
| Hinterlegungsdatum: | 12 Nov 2018 11:16 |
| Letzte Änderung: | 04 Feb 2022 12:40 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum