Lossless Compression of Surfaces Described as Points
In many applications, objects are represented by a collection of unorganized points that scan the surface of the object. In such cases, an efficient way of storing this information is of interest. In this paper we present an arithmetic compression scheme that uses a tree representation of the data set and allows for better compression rates than generalpurpose methods.
Unable to display preview. Download preview PDF.
- [CHF96]Wayne O. Cochran, John C. Hart, and Patrick J. Flynn. Fractal volume compression. IEEE Transactions on Visualization and Computer Graphics, 2(4):313–322, December 1996.Google Scholar
- [CLR90]T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.Google Scholar
- [GEJ96]M. Gokmen, I. Ersoy, and A. K. Jain. Compression of fingerprint images using hybrid image model. In Int. Conf. on Image Processing, volume III, pages 395–398, Lausanne, September 1996.Google Scholar
- [HDD+94]H. Hoppe, T. DeRose, T. Duchamp, M. Halstead, H. Jin, J. McDonald, J. Schweitzer, and W. Stuetz. Piecewise smooth surface reconstruction. Computer Graphics, 28((SIGGRAPH 1994 Proceedings)):295–302, 1994.Google Scholar
- [IP98]Insung Ihm and Sanghun Park. Wavelet-based 3d compression scheme for very large volume data. In Kellogg Booth Wayne Davis and Alain Fourier (Editors), editors, Proceedings of the 24th Graphics Interface, pages 107–116, San Francisco, June 1998. Morgan Kaufmann.Google Scholar
- [Nel91]Mark R. Nelson. Arithmetic coding and statistical modeling. Dr. Dobb’s Journal of Software Tools, 16(2):6, February 1991.Google Scholar
- [WNC87]I. H. Witten, R. M. Neal, and J. G. Cleary. Arithmetic coding for data compression. Communications of the ACM, 30(6), June 1987.Google Scholar