Content-addressable memories for storing and processing recursively subdivided images and trees

Abstract

Content-addressable memories may be arranged to store three-state information in a reliable and efficient manner. They can be applied to the representation of tree structures used in some graphic display applications, such as quadtrees and octrees, avoiding the need for pointers, and speeding up many operations. Examples are given for picture updating and scan conversion.