A Parallelly Decodeable Compression Scheme for Efficient Point-Cloud Rendering

Simple item page
dc.contributor.authorSchnabel, Ruwenen_US
dc.contributor.authorMoeser, Sebastianen_US
dc.contributor.authorKlein, Reinharden_US
dc.contributor.editorM. Botsch and R. Pajarola and B. Chen and M. Zwickeren_US
dc.date.accessioned2014-01-29T16:52:13Z
dc.date.available2014-01-29T16:52:13Z
dc.date.issued2007en_US
dc.description.abstractWe 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.description.seriesinformationEurographics Symposium on Point-Based Graphicsen_US
dc.identifier.isbn978-3-905673-51-7en_US
dc.identifier.issn1811-7813en_US
dc.identifier.urihttps://doi.org/10.2312/SPBG/SPBG07/119-128en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories 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 operationsen_US
dc.titleA Parallelly Decodeable Compression Scheme for Efficient Point-Cloud Renderingen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
119-128.pdf
Size:
362.48 KB
Format:
Adobe Portable Document Format
Download
Collections
Symposium on Point Based Graphics 07