SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
Optimized geometry compression for real-time rendering
VIS '97 Proceedings of the 8th conference on Visualization '97
Geometric compression through topological surgery
ACM Transactions on Graphics (TOG)
Progressive forest split compression
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
QSplat: a multiresolution point rendering system for large meshes
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Efficient high quality rendering of point sampled geometry
EGRW '02 Proceedings of the 13th Eurographics workshop on Rendering
Hardware-compatible vertex compression using quantization and simplification
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
PNORMS: platonic derived normals for error bound compression
Proceedings of the ACM symposium on Virtual reality software and technology
Technologies for 3D mesh compression: A survey
Journal of Visual Communication and Image Representation
Predictive compression of geometry, color and normal data of 3-D mesh models
IEEE Transactions on Circuits and Systems for Video Technology
SMI 2012: Full Encoding normal vectors using optimized spherical coordinates
Computers and Graphics
On floating-point normal vectors
EGSR'10 Proceedings of the 21st Eurographics conference on Rendering
| Hi-index | 0.01 |
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.