The hybrid quadtree is a space-optimized quadtree data structure which shows promise in its efficiency and similarity to its well-known forebearer. This, and the fact that manipulation algorithms are similar to those of the normal quadtree but including features to take advantage of path codes, make the hybrid quadtree not only an attractive, but also desirable structure for many intensive picture processing tasks. This paper conveys preliminary data obtained on the effectiveness of the hybrid quadtree in application and therefore elaborates some of its properties. 17 refs.
