SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Real time compression of triangle mesh connectivity
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
ACM Transactions on Information Systems (TOIS)
The digital Michelangelo project: 3D scanning of large statues
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Progressive geometry compression
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
QSplat: a multiresolution point rendering system for large meshes
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Spectral processing of point-sampled geometry
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Efficient high quality rendering of point sampled geometry
EGRW '02 Proceedings of the 13th Eurographics workshop on Rendering
Efficient simplification of point-sampled surfaces
Proceedings of the conference on Visualization '02
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Computing and Rendering Point Set Surfaces
IEEE Transactions on Visualization and Computer Graphics
Interactive Sampling and Rendering for Complex and Procedural Geometry
Proceedings of the 12th Eurographics Workshop on Rendering Techniques
Computing Minimum-Weight Perfect Matchings
INFORMS Journal on Computing
Level of Detail for 3D Graphics
Level of Detail for 3D Graphics
Progressive point set surfaces
ACM Transactions on Graphics (TOG)
A survey of point-based techniques in computer graphics
Computers and Graphics
SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics
Multiresolution point-set surfaces
GI '08 Proceedings of graphics interface 2008
| Hi-index | 0.00 |
We present a reordering-based procedure for the multiresolution decomposition of a point cloud in this paper. The points are first reordered recursively based on an optimal pairing. Each level of reordering induces a division of the points into approximation and detail values. A balanced quantization at each level results in further compression. The original point cloud can be reconstructed without loss from the decomposition. Our scheme does not require local reference planes for encoding or decoding and is progressive. The points also lie on the original manifold at all levels of decomposition. The scheme can be used to generate different discrete LODs of the point set with fewer points in each at low BPP numbers. We also present a scheme for the progressive representation of the point set by adding the detail values selectively. This results in the progressive approximation of the original shape with dense points even at low BPP numbers. The shape gets refined as more details are added and can reproduce the original point set. This scheme uses a wavelet decomposition of the detail coefficients of the multiresolution decomposition. Progressiveness is achieved by including different levels of the DWT decomposition at all multiresolution representation levels. We show that this scheme can generate much better approximations at equivalent BPP numbers for the point set.