Octrees: Construction, Representation, And Manipulation

The octree representation of three-dimensional objects is a generalization of the two-dimensional quadtree. It is a hierarchical representation based on the principle of recursive subdivision. The major features of the octree representation are that it is a hierarchical data structure, objects are kept in a spatially pre-sorted order at all time, and it has spatial addressability. Many operations performed on octrees can be easily implemented as tree traversals. These special features make octree representation very attractive in many applications such as solid modeling, computer graphics, computer-aided design/manufacturing, computer vision, robotics, space planning, and medical imaging. This paper surveys the recent advances made in the construction, representation, and manipulation of the octree representation.

[1]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[2]  C. Ian Connolly,et al.  Cumulative generation of octree models from range data , 1984, ICRA.

[3]  Kenneth Steiglitz,et al.  Operations on Images Using Quad Trees , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Eiji Kawaguchi,et al.  On a Method of Binary-Picture Representation and Its Application to Data Compression , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.