Fast Normal Vector Compression with Bounded Error
View/
Date
2007Pay-Per-View via TIB Hannover:
Try if this item/paper is available.
Metadata
Show full item recordAbstract
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.
BibTeX
@inproceedings {10.2312:SGP:SGP07:263-272,
booktitle = {Geometry Processing},
editor = {Alexander Belyaev and Michael Garland},
title = {{Fast Normal Vector Compression with Bounded Error}},
author = {Griffith, E. J. and Koutek, M. and Post, Frits H.},
year = {2007},
publisher = {The Eurographics Association},
ISSN = {1727-8384},
ISBN = {978-3-905673-46-3},
DOI = {10.2312/SGP/SGP07/263-272}
}
booktitle = {Geometry Processing},
editor = {Alexander Belyaev and Michael Garland},
title = {{Fast Normal Vector Compression with Bounded Error}},
author = {Griffith, E. J. and Koutek, M. and Post, Frits H.},
year = {2007},
publisher = {The Eurographics Association},
ISSN = {1727-8384},
ISBN = {978-3-905673-46-3},
DOI = {10.2312/SGP/SGP07/263-272}
}