Octree approximation and compression methods

12 years 2 months ago
Octree approximation and compression methods
Techniques are presented to progressively approximate and compress in a lossless manner two-colored (i.e. binary) 3D objects (as well as objects of arbitrary dimensionality). The objects are represented by a region octree implemented using a pointerless representation based on locational codes. Approximation is achieved through the use of a forest. This method labels the internal nodes of the octree as GB or GW, depending on the number of children being of type GB or GW. In addition, all BLACK nodes are labeled GB, while all WHITE nodes are labeled GW. A number of different image approximation methods are discussed that make use of a forest. The advantage of these methods is that they are progressive which means that as more of the object is transmitted, the better is the approximation. This makes these methods attractive for use on the worldwide web. Progressive transmission has the drawback that there is an overhead in requiring extra storage. A progressive forest-based approximatio...
Hanan Samet, Andrzej Kochut
Added 14 Jul 2010
Updated 14 Jul 2010
Type Conference
Year 2002
Where 3DPVT
Authors Hanan Samet, Andrzej Kochut
Comments (0)