In the course of working with standard computational geometry algorithms in developing image conversion tools, we encountered several different problems of scale and representation. None of the algorithms in the literature had a unified solution that coupled the representation of spatial entities with the requisite access algorithms. Our data structure was specifically designed to handle objects that occupy a sub-area of an image, and the corresponding access methods allow for both two dimensional range queries and quick access to single objects. In the process of image conversion, fast range queries are essential when trying to quickly answer questions of nearness, connectedness, containment and intersection.