Given a seed set, we need to determine all cells in the seed set whose range contains a given value. Several search structures exist which will perform this operation in O(log n) time. Two in particular, the interval tree and the segment tree, are being investigated in further detail.