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.

• Type: Conference
• Year: 2000
• Where: SSPR
• Authors: Juan Ramón Rico-Juan, Jorge Calera-Rubio, Rafael C. Carrasco
• Keywords: Arithmetic Compression Scheme, Better Compression Rates, Pattern Recognition, SSPR 2000, Unorganized Points