A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Fast Normal Vector Compression with Bounded Error
[article]
2007
Symposium on geometry processing : [proceedings]. Symposium on Geometry Processing
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.
doi:10.2312/sgp/sgp07/263-272
fatcat:4t6rlgrebzaifk7cx2w5rw2gku