In this paper, we consider the problem of obtaining a hierarchical structure representing the overlay of two hierarchical subdivisions at multiple resolutions. This problem has an impact in geographic information systems, where the issue of overlapping two maps at multiple resolutions has a relevant importance. We provide a formal definition of such an overlay hierarchy, and propose an efficient bottom-up algorithm to compute it.