Fast Normal Vector Compression with Bounded Error

Eric Griffith, Michal Koutek, Frits H. Post
Proc. Geometry Processing - 2007
Download the publication : GKP07a.pdf [1.4Mo]  
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.

Images and movies

GKP07a.JPG [10Ko]
 

BibTex references

@InProceedings { GKP07a,
  author       = "Griffith, Eric and Koutek, Michal and Post, Frits H.",
  title        = "Fast Normal Vector Compression with Bounded Error",
  booktitle    = "Proc. Geometry Processing",
  year         = "2007",
  editor       = "Alexander Belyaev and Michael Garland",
  publisher    = "Eurographics Association",
  address      = "Barcelona, Spain",
  note         = "10.2312/SGP/SGP07/263-272",
  url          = "http://graphics.tudelft.nl/Publications-new/2007/GKP07a"
}

Other publications in the database

» Eric Griffith
» Michal Koutek
» Frits H. Post





Back