Sciweavers

Share
SGP
2007

Fast normal vector compression with bounded error

8 years 7 months ago
Fast normal vector compression with bounded error
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second uses fixed-precision barycentric coordinates. For both, we provide fast (de)compression algorithms and a rigorous upper bound on compression error. We discuss the effects of base polyhedra on the error bound and suggest polyhedra derived from spherical coverings. Finally, we present compression and decompression results, and we compare our methods to others from the literature. Categories and Subject Descriptors (according to ACM CCS): I.3.0 [Computer Graphics]: General I.3.6 [Computer Graphics]: Methodology and Techniques E.4 [Data]: Coding and Information Theory
Eric J. Griffith, Michal Koutek, Frits H. Post
Added 30 Sep 2010
Updated 30 Sep 2010
Type Conference
Year 2007
Where SGP
Authors Eric J. Griffith, Michal Koutek, Frits H. Post
Comments (0)
books