Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
Vector quantization and signal compression
Vector quantization and signal compression
The digital Michelangelo project: 3D scanning of large statues
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
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
Space-time points: 4d splatting on efficient grids
VVS '02 Proceedings of the 2002 IEEE symposium on Volume visualization and graphics
Proceedings of the conference on Visualization '01
VMV '01 Proceedings of the Vision Modeling and Visualization Conference 2001
ACM SIGGRAPH 2003 Papers
High-Quality Point-Based Rendering on Modern GPUs
PG '03 Proceedings of the 11th Pacific Conference on Computer Graphics and Applications
Perspective accurate splatting
GI '04 Proceedings of the 2004 Graphics Interface Conference
A survey of point-based techniques in computer graphics
Computers and Graphics
Space-efficient boundary representation of volumetric objects
EGVISSYM'01 Proceedings of the 3rd Joint Eurographics - IEEE TCVG conference on Visualization
Progressive compression of point-sampled models
SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics
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
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
Instant points: fast rendering of unprocessed point clouds
SPBG'06 Proceedings of the 3rd Eurographics / IEEE VGTC conference on Point-Based Graphics
| Hi-index | 0.00 |
In this paper we present a compression scheme for large point scans including per-point normals. For the encoding of such scans we introduce a particular type of closest sphere packing grids, the hexagonal close packing (HCP). HCP grids provide a structure for an optimal packing of 3D space, and for a given sampling error they result in a minimal number of cells if geometry is sampled into these grids. To compress the data, we extract linear sequences (runs) of filled cells in HCP grids. The problem of determining optimal runs is turned into a graph theoretical one. Point positions and normals in these runs are incrementally encoded. At a grid spacing close to the point sampling distance, the compression scheme only requires slightly more than 3 bits per point position. Incrementally encoded per-point normals are quantized at high fidelity using only 5 bits per normal (see Figure 1). The compressed data stream can be decoded in the graphics processing unit (GPU). Decoded point positions are saved in graphics memory, and they are then used on the GPU again to render point primitives. In this way we render gigantic point scans from their compressed representation in local GPU memory at interactive frame rates (see Figure 2).