Compression of Dense and Regular Point Clouds
We 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 p...
Saved in:
| Published in: | Computer graphics forum Vol. 25; no. 4; pp. 709 - 716 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Oxford, UK
Blackwell Publishing Ltd
01.12.2006
|
| Subjects: | |
| ISSN: | 0167-7055, 1467-8659 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We 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. |
|---|---|
| Bibliography: | ArticleID:CGF993 istex:71E14A4CC19F2C881DFF3104BC8842A120D8BE7C ark:/67375/WNG-7RKB3S15-6 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| ISSN: | 0167-7055 1467-8659 |
| DOI: | 10.1111/j.1467-8659.2006.00993.x |