Compression of Dense and Regular Point Clouds

Simple item page
dc.contributor.authorMerry, Bruceen_US
dc.contributor.authorMarais, Patricken_US
dc.contributor.authorGain, Jamesen_US
dc.date.accessioned2015-02-21T12:25:25Z
dc.date.available2015-02-21T12:25:25Z
dc.date.issued2006en_US
dc.description.abstractWe present a simple technique for single-rate compression of point clouds sampled from a surface, based on a spanning tree of the points. Unlike previous methods, we predict future vertices using both a linear predictor, which uses the previous edge as a predictor for the current edge, and lateral predictors that rotate the previous edge 90 left or right about an estimated normal.By careful construction of the spanning tree and choice of prediction rules, our method improves upon existing compression rates when applied to regularly sampled point sets, such as those produced by laser range scanning or uniform tesselation of higher-order surfaces. For less regular sets of points, the compression rate is still generally within 1.5 bits per point of other compression algorithms.en_US
dc.description.number4en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume25en_US
dc.identifier.doi10.1111/j.1467-8659.2006.00993.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages709-716en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2006.00993.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleCompression of Dense and Regular Point Cloudsen_US
Files
Collections
25-Issue 4