Processing spatial joins efficiently is crucial to rendering the spatial data analysis process feasible. As pointed out in many works, the exact intersection test of two spatial objects is the most time-consuming and I/Oconsuming step in processing spatial joins. The use of approximations can reduce the need for examining the exact geometry of spatial objects in order to find the intersecting ones. In previous works, approximations were proposed to perform spatial joins between similar objects: polygons