Arithmetic coding for data compression
Communications of the ACM
Interpolating Subdivision for meshes with arbitrary topology
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
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
Surfels: surface elements as rendering primitives
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
OpenGL Programming Guide: The Official Guide to Learning OpenGL, Version 1.2
OpenGL Programming Guide: The Official Guide to Learning OpenGL, Version 1.2
Progressive point set surfaces
ACM Transactions on Graphics (TOG)
Statistical geometry representation for efficient transmission and rendering
ACM Transactions on Graphics (TOG)
A Generic Scheme for Progressive Point Cloud Coding
IEEE Transactions on Visualization and Computer Graphics
JBEAM: multiscale curve coding via beamlets
IEEE Transactions on Image Processing
Compression of point-based 3D models by shape-adaptive wavelet coding of multi-height fields
SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics
Octree-based progressive geometry coding of point clouds
SPBG'06 Proceedings of the 3rd Eurographics / IEEE VGTC conference on Point-Based Graphics
Octree-based point-cloud compression
SPBG'06 Proceedings of the 3rd Eurographics / IEEE VGTC conference on Point-Based Graphics
| Hi-index | 0.00 |
A compact representation scheme is presented for 3-D point data. To describe underlying surface from raw point samples, we dyadically divide a 3-D domain enclosing whole points. Then, local points in each cube are approximated by a plane patch, yielding a multiscale representation of 3-D surface. To reduce the redundancy between different scale models, the geometry innovation is evaluated between different scale planes, which reveals the Euclidian distance between planes. Finally, the geometry innovation coefficients are compressed by a zerotree-based encoder. Based on the multiscale plane representation of 3-D geometry and the efficient plane decomposition method, the proposed scheme provides a desirable framework for 3-D point geometry processing.