SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
The digital Michelangelo project: 3D scanning of large statues
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
QSplat: a multiresolution point rendering system for large meshes
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Realistic image synthesis using photon mapping
Realistic image synthesis using photon mapping
Efficient high quality rendering of point sampled geometry
EGRW '02 Proceedings of the 13th Eurographics workshop on Rendering
PNORMS: platonic derived normals for error bound compression
Proceedings of the ACM symposium on Virtual reality software and technology
Progressive Compression of Normal Vectors
3DPVT '06 Proceedings of the Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)
Fast normal vector compression with bounded error
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
High quality normal map compression
GH '06 Proceedings of the 21st ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
On floating-point normal vectors
EGSR'10 Proceedings of the 21st Eurographics conference on Rendering
| Hi-index | 0.00 |
We present a method for encoding unit vectors based on spherical coordinates that out-performs existing encoding methods both in terms of accuracy and encoding/decoding time. Given a tolerance @e, we solve a simple, discrete optimization problem to find a set of points on the unit sphere that can trivially be indexed such that the difference in angle between the encoded vector and the original are no more than @e apart. To encode a unit vector, we simply compute its spherical coordinates and round the result based on the prior optimization solution. We also present a moving frame method that further reduces the amount of data to be encoded when vectors have some coherence. Our method is extremely fast in terms of encoding and decoding both of which take constant time O(1). The accuracy of our encoding is also comparable or better than previous methods for encoding unit vectors.