Parallel algorithms on meshes and pyramids for iconic indexing are presented. The algorithms are asymptotically superior to previously known parallel algorithms. Also presented are experimental results for these algorithms on the Connection Machine (CM-2).
