Simple and Efficient Normal Encoding with Error Bounds

Simple item page
dc.contributor.authorSchinko, Christophen_US
dc.contributor.authorUllrich, Torstenen_US
dc.contributor.authorFellner, Dieter W.en_US
dc.contributor.editorIan Grimstead and Hamish Carren_US
dc.date.accessioned2013-10-31T10:30:54Z
dc.date.available2013-10-31T10:30:54Z
dc.date.issued2011en_US
dc.description.abstractNormal 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.en_US
dc.description.seriesinformationTheory and Practice of Computer Graphicsen_US
dc.identifier.isbn978-3-905673-83-8en_US
dc.identifier.urihttps://doi.org/10.2312/LocalChapterEvents/TPCG/TPCG11/063-065en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.4.2 [Image Processing and Computer Vision]: Compression (Coding)-Approximate methods I.3.6 [Computer Graphics]: Methodology and Techniques-Graphics data structures and data typesen_US
dc.titleSimple and Efficient Normal Encoding with Error Boundsen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
063-065.pdf
Size:
399.39 KB
Format:
Adobe Portable Document Format
Download
Collections
EG UK Theory and Practice of Computer Graphics 2011