This paper describes algorithms for computing geometric properties of binary images represented as quadtrees. All the algorithms involve a simple traversal of the tree. Each algorithm, however, performs different operations at the nodes of the tree. Algorithms are presented for finding the area, centroid, union, intersection, and complement of binary images. All the algorithms are linear in the number(s) of nodes in the tree(s).