Simulating essential pyramids

When an image contains multiple objects of interest simple algorithms try to simultaneously use the apex for each object, creating a severe bottleneck; previous asymptotically efficient algorithms have tended to be quite complicated. A novel approach is presented which systematically simulates a separate 'essential' pyramid over each object. This simplifies algorithm development, since algorithms can be written assuming that there is only a single object. This approach can yield optimal or nearly optimal algorithms for the pyramid computer, and can also be used for many nonpyramid architectures. For several of these, the simulated pyramids over all objects can perform an algorithm nearly as fast as pyramid computer over a single object.<<ETX>>