Octree Data Structures and Creation by Stacking

Abstract

Efficient, compact data structures are necessary for the representation of octrees. First, several concrete data structures for the octree abstract data type will be compared in terms of storage space required and execution time needed to perform operations such as to find a certain node or obei. We compare information theoretic minimal representations, digital search trees sometimes storing some information in an immediate mode without pointers, and storing the set of rays, which is often the most compact.

Keywords

Interior Node Virtual Memory Quad Tree Empty Node Extra Storage

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This material is based upon work supported by the National Science Foundation under grant number ECs- 8351942, and by the Schlumberger-Doll Research Labs, Ridgefield, CT. The second authors was also supported in part by a fulbright award.