ABSTRACT

ABSTRACT Topological relations can be determined efficiently in raster hierarchies (image pyramids, quadtrees), by applying a recursive procedure for an adapted intersection model. At least at the higher levels of a hierarchy, the procedure has to deal with mixed pixels. That requires a more flexible use and interpretation of intersection schemata. It is shown that the found methodology can be transferred to deal with regions with spatial uncertainty, too.