Point set compression through BSP quantization

Point set compression through BSP quantization
Alex Bordignon, Thomas Lewiner, Hélio Lopes, Geovan Tavares, Rener Castro

Sibgrapi 2006 (XIX Brazilian Symposium on Computer Graphics and Image Processing): pp. 229-236 (october 2006)

Abstract:

This work introduces a new compression scheme for point sets. This scheme relies on an adaptive binary space partition (BSP) that takes into account the geometric structure of the point set. This choice introduces geometrical rather than combinatorial information in the compression scheme. In order to effectively improve the final compression ratio, this partition is encoded in a progressive manner, decreasing the number of bits used for the quantization at each subdivision. This strategy distributes the extra cost of the geometry encoding onto the maximal number of points, compressing in average 15% more than previous techniques.

Downloads:

PDF paper (3.3 MB)
PPT presentation (14.2 MB)
Point set compression through BSP quantization

BibTeX:

@inproceedings{pointset_compression_sibgrapi,
    author = {Alex Bordignon and Thomas Lewiner and Hélio Lopes and Geovan Tavares and Rener Castro},
    title = {Point set compression through BSP quantization},
    year = {2006},
    month = {october},
    booktitle = {Sibgrapi 2006 (XIX Brazilian Symposium on Computer Graphics and Image Processing)},
    pages = {229--236},
    publisher = {IEEE},
    address = {Manaus, AM},
    doi = {10.1109/SIBGRAPI.2006.36},
    url = {\url{http://thomas.lewiner.org/pdfs/pointset_compression_sibgrapi.pdf}}
}


Last modifications on July 3rd, 2013