next up previous
Next: References Up: Object Manipulation for Document Previous: Empirical Results

Conclusions

Given the constraint of linear space requirements, we have developed an efficient system for inserting, deleting and accessing objects associated with a two-dimensional sub-area. In addition, bounding and intersection queries can be performed in sub-linear time. The algorithm was developed specifically with the demands of a general image conversion blackboard in mind. Testing was done which shows that with just a few thousand objects being stored, our algorithm provides real advantages when performing intersection and containment queries. Once tens or hundreds of thousands of objects are involved, the need for algorithms such as this become imperative.



Richard Romero
Tue Jun 13 19:49:23 EDT 1995