| dc.contributor.author | Schnabel, Ruwen | en_US |
| dc.contributor.author | Moeser, Sebastian | en_US |
| dc.contributor.author | Klein, Reinhard | en_US |
| dc.contributor.editor | M. Botsch and R. Pajarola and B. Chen and M. Zwicker | en_US |
| dc.date.accessioned | 2014-01-29T16:52:13Z | |
| dc.date.available | 2014-01-29T16:52:13Z | |
| dc.date.issued | 2007 | en_US |
| dc.identifier.isbn | 978-3-905673-51-7 | en_US |
| dc.identifier.issn | 1811-7813 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/SPBG/SPBG07/119-128 | en_US |
| dc.description.abstract | We present a point-cloud compression algorithm that allows fast parallel decompression on the GPU for interactive applications. We achieve bitrates of less than four bits per normal-equipped point. Our method enables holefree level-of-detail point rendering. We also show that using only up to two bits per point, high-quality renderings can still be obtained if normals are estimated in image-space. The algorithm is based on vector quantization of an atlas of height-fields that have been sampled over primitive shapes which approximate the geometry. | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | Categories and Subject Descriptors (according to ACM CCS): E.4 [Coding and information Theory]: Data compaction and compression I.3.3 [Computer Graphics]: Display algorithms I.3.3 [Computer Graphics]: Digitizing and scanning I.3.3 [Computer Graphics]: Bitmap and framebuffer operations | en_US |
| dc.title | A Parallelly Decodeable Compression Scheme for Efficient Point-Cloud Rendering | en_US |
| dc.description.seriesinformation | Eurographics Symposium on Point-Based Graphics | en_US |
