In this paper exact bintree as a new class of hierarchical approximati
on models is introduced. A new algorithm for the conversion from bound
ary representations to exact bintrees is developed on the base of the
bintree model, a generalization of the quadtree and octree. It allows
face, edge and vertex node types as well as the classical black, white
and grey nodes. The exact bintree is a general method of binary cellu
lar models. The other corresponding binary models can be easily deduce
d from the exact bintree. Using them, the required amount of memory is
less than that in terms of bintrees and octrees. (C) 1998 Elsevier Sc
ience B.V. All rights reserved.